A characterization of \(Q\)-polynomial distance-regular graphs
From MaRDI portal
Publication:925003
DOI10.1016/j.disc.2007.08.034zbMath1171.05054MaRDI QIDQ925003
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
05E30: Association schemes, strongly regular graphs
Related Items
Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets, The \(Q\)-polynomial idempotents of a distance-regular graph, 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}\), A characterization of bipartite Leonard pairs using the notion of a tail
Cites Work