A characterization of Q-polynomial distance-regular graphs
From MaRDI portal
Publication:925003
DOI10.1016/J.DISC.2007.08.034zbMATH Open1171.05054OpenAlexW2036135432MaRDI QIDQ925003FDOQ925003
Authors: 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
Recommendations
- The \(Q\)-polynomial idempotents of a distance-regular graph
- A characterization of \(Q\)-polynomial distance-regular graphs using the intersection numbers
- Distance-regular graphs of type \(E_1\circ E_d\) and the \(Q\)-polynomial property
- Bipartite \(Q\)-polynomial distance-regular graphs
- On \(Q\)-polynomial distance-regular graphs \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)
Cites Work
Cited In (22)
- A new inequality for distance-regular graphs
- Directed distance regular graphs with the Q-polynomial property
- On the multiplicities of the primitive idempotents of a \(Q\)-polynomial distance-regular graph
- \(Q\)-polynomial distance-regular graphs with \(a_1=0\)
- Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph
- On bipartite \(Q\)-polynomial distance-regular graphs with diameter 9, 10, or 11
- A characterization of \(Q\)-polynomial distance-regular graphs using the intersection numbers
- The displacement and split decompositions for a \(Q\)-polynomial distance-regular graph
- A characterization of bipartite Leonard pairs using the notion of a tail
- A \(Q\)-polynomial structure associated with the projective geometry \(L_N (q)\)
- Homotopy in \(Q\)-polynomial distance-regular graphs
- The Norton algebra of a \(Q\)-polynomial distance-regular graph
- Projective geometries, \(Q\)-polynomial structures, and quantum groups
- Title not available (Why is that?)
- A class of distance-regular graphs that are \(\phi\)-polynomial
- A characterization of Leonard pairs using the parameters \(\{a_i\}^d_{i=0}\)
- Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets
- A duality between pairs of split decompositions for a Q-polynomial distance-regular graph
- The \(Q\)-polynomial idempotents of a distance-regular graph
- Three distance characteristic polynomials of some graphs
- Distance-regular graphs of type \(E_1\circ E_d\) and the \(Q\)-polynomial property
- P and Q polynomial schemes with \(q=-1\)
This page was built for publication: A characterization of \(Q\)-polynomial distance-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925003)