Bipartite distance-regular graphs: the \(Q\)-polynomial property and pseudo primitive idempotents

DOI10.1016/j.disc.2014.04.025zbMath1297.05264OpenAlexW2023306949MaRDI QIDQ397139

Michael S. Lang

Publication date: 8 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.04.025

zbMATH Keywords

Terwilliger algebradistance-regular graphassociation schemesubconstituent algebrapseudo primitive idempotent

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items

Using symbolic computation to prove nonexistence of distance-regular graphs ⋮ On bipartite \(Q\)-polynomial distance-regular graphs with diameter 9, 10, or 11 ⋮ A diagram associated with the subconstituent algebra of a distance-regular graph ⋮ Bipartite distance-regular graphs and taut pairs of pseudo primitive idempotents

Cites Work

• Unnamed Item
• Unnamed Item
• The subconstituent algebra of an association scheme. I
• The subconstituent algebra of an association scheme. II
• The pseudo-cosine sequences of a distance-regular graph
• The Terwilliger algebras of bipartite \(P\)- and \(Q\)-polynomial schemes
• Homogeneous graphs and regular near polygons
• A new inequality for bipartite distance-regular graphs.
• Distance-regular graphs, pseudo primitive idempotents, and the Terwilliger algebra.
• Almost 2-homogeneous bipartite distance-regular graphs
• Tails of bipartite distance-regular graphs
• Spin models on bipartite distance-regular graphs
• Taut distance-regular graphs and the subconstituent algebra
• Algebraic Graph Theory