The \(Q\)-polynomial idempotents of a distance-regular graph

DOI10.1016/J.JCTB.2010.07.002zbMath1205.05069OpenAlexW2024905472MaRDI QIDQ602724

Aleksandar Jurišić, Arjana Žitnik, Paul M. Terwilliger

Publication date: 5 November 2010

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.2010.07.002

zbMATH Keywords

distance-regular graphscharacterization\(Q\)-polynomialtail

Mathematics Subject Classification ID

Graph polynomials (05C31) Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Related Items (6)

Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets ⋮ A characterization of Leonard pairs using the parameters \(\{a_i\}^d_{i=0}\) ⋮ A characterization of Leonard pairs using the notion of a tail ⋮ \(Q\)-polynomial distance-regular graphs and a double affine Hecke algebra of rank one ⋮ 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
• The subconstituent algebra of an association scheme. I
• A characterization of \(Q\)-polynomial distance-regular graphs
• A new inequality for distance-regular graphs
• A new inequality for bipartite distance-regular graphs.
• Tight distance-regular graphs
• Tails of bipartite distance-regular graphs
• Orthogonal Polynomials, Duality and Association Schemes

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