The \(Q\)-polynomial idempotents of a distance-regular graph
From MaRDI portal
Publication:602724
DOI10.1016/j.jctb.2010.07.002zbMath1205.05069MaRDI 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
05C31: Graph polynomials
05E30: Association schemes, strongly regular graphs
05C12: Distance in graphs
Related Items
Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets, A characterization of Leonard pairs using the notion of a tail, A characterization of \(Q\)-polynomial distance-regular graphs using the intersection numbers, A characterization of Leonard pairs using the parameters \(\{a_i\}^d_{i=0}\), \(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
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