Distance-regular graphs, the subconstituent algebra, and the Q-polynomial property

2022/07/15 by Terwilliger, Paul · 4 citations
#05E30 #Combinatorics (math.CO) #FOS: Mathematics #Quantum Algebra (math.QA)

paper · doi:10.48550/arxiv.2207.07747

Abstract

This survey paper contains a tutorial introduction to distance-regular graphs, with an emphasis on the subconstituent algebra and the Q-polynomial property.

Cited by

• An equitable partition for the distance-regular graph of the bilinear forms
• Every Q-polynomial distance-regular graph is sharp over ℝ
• The fundamental module of S₃-symmetric tridiagonal algebra associated with cycles
• Raising and lowering maps for tridiagonal pairs

Related

• The Norton algebra of a Q-polynomial distance-regular graph
• A characterization of Q-polynomial distance-regular graphs
• On the Q-polynomial property of the full bipartite graph of a Hamming graph
• Distance-regular graphs of q-Racah type and the universal Askey-Wilson\n algebra
• A characterization of Q-polynomial distance-regular graphs using the intersection numbers