A characterization of \(Q\)-polynomial distance-regular graphs

DOI10.1016/J.DISC.2007.08.034zbMath1171.05054OpenAlexW2036135432MaRDI QIDQ925003

Arlene A. Pascasio

Publication date: 29 May 2008

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

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

zbMATH Keywords

distance-regular graphassociation scheme\(Q\)-polynomial

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (5)

Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets ⋮ The \(Q\)-polynomial idempotents of a distance-regular graph ⋮ A characterization of Leonard pairs using the parameters \(\{a_i\}^d_{i=0}\) ⋮ A characterization of bipartite Leonard pairs using the notion of a tail ⋮ A characterization of \(Q\)-polynomial distance-regular graphs using the intersection numbers

Cites Work

• Unnamed Item
• Unnamed Item
• A new inequality for distance-regular graphs
• Problems in algebraic combinatorics
• LEONARD PAIRS AND THE ASKEY–WILSON RELATIONS

This page was built for publication: A characterization of \(Q\)-polynomial distance-regular graphs