\(Q\)-polynomial distance-regular graphs with \(a_1=0\)

DOI10.1016/j.ejc.2004.02.001zbMath1050.05120OpenAlexW2006977261MaRDI QIDQ1883601

Štefko Miklavič

Publication date: 13 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2004.02.001

zbMATH Keywords

1-homogeneousDistance-regular graphQ-polynomial

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (8)

On bipartite \(Q\)-polynomial distance-regular graphs with \(c_{2}=1\) ⋮ Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets ⋮ On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency ⋮ Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3 ⋮ Triangle-free distance-regular graphs ⋮ A note on triangle-free distance-regular graphs with \(a_2\neq 0\) ⋮ \(Q\)-polynomial distance-regular graphs with \(a_1=0\) and \(a_2\neq 0\) ⋮ An equitable partition for a distance-regular graph of negative type

Cites Work

• Unnamed Item
• Unnamed Item
• Spectra of bipartite \(P\)- and \(Q\)-polynomial association schemes
• Homogeneous graphs and regular near polygons
• A new inequality for distance-regular graphs
• Problems in algebraic combinatorics
• Tight distance-regular graphs
• A local approach to 1-homogeneous graphs

This page was built for publication: \(Q\)-polynomial distance-regular graphs with \(a_1=0\)