An equitable partition for a distance-regular graph of negative type

DOI10.1016/j.jctb.2005.02.007zbMath1076.05088OpenAlexW2093878797MaRDI QIDQ2573642

Štefko Miklavič

Publication date: 22 November 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2005.02.007

zbMATH Keywords

distance-regular graphclassical parametersQ-polynomialKite-free

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (1)

The Terwilliger algebra of a distance-regular graph of negative type

Cites Work

• Unnamed Item
• Weak-geodetically closed subgraphs in distance-regular graphs
• Classical distance-regular graphs of negative type
• Homogeneous graphs and regular near polygons
• A new inequality for distance-regular graphs
• Problems in algebraic combinatorics
• \(Q\)-polynomial distance-regular graphs with \(a_1=0\)
• Kite-free \(P\)- and \(Q\)-polynomial schemes
• Kite-free distance-regular graphs

This page was built for publication: An equitable partition for a distance-regular graph of negative type