The last subconstituent of a bipartite \(Q\)-polynomial distance-regular graph

DOI10.1016/S0195-6698(03)00059-3zbMath1022.05086OpenAlexW1984684841MaRDI QIDQ1399682

John S. IV. Caughman

Publication date: 30 July 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(03)00059-3

zbMATH Keywords

distance-regular graph\(Q\)-polynomial graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (6)

Distance-regular graphs of large diameter that are completely regular clique graphs ⋮ On bipartite \(Q\)-polynomial distance-regular graphs ⋮ On bipartite \(Q\)-polynomial distance-regular graphs with \(c_{2}=1\) ⋮ Homogeneity of a distance-regular graph which supports a spin model ⋮ Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets ⋮ The last subconstituent of the Hemmeter graph

Cites Work

• The last subconstituent of the Hemmeter graph
• The Terwilliger algebras of bipartite \(P\)- and \(Q\)-polynomial schemes
• Bipartite \(Q\)-polynomial quotients of antipodal distance-regular graphs
• A new inequality for distance-regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The last subconstituent of a bipartite \(Q\)-polynomial distance-regular graph