Distance-regular graphs of type E₁ E_d and the Q-polynomial property
From MaRDI portal
Publication:3513650
Recommendations
- A characterization of Q-polynomial distance-regular graphs
- The \(Q\)-polynomial idempotents of a distance-regular graph
- Tight distance-regular graphs and the \(Q\)-polynomial property
- scientific article; zbMATH DE number 1379440
- On \(Q\)-polynomial distance-regular graphs \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)
Cited in
(8)- Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph
- Tight distance-regular graphs and the \(Q\)-polynomial property
- A \(Q\)-polynomial structure associated with the projective geometry \(L_N (q)\)
- Distance-regular graphs with \(b_ i=c_{d-i}\) and two P-polynomial structures
- The Norton algebra of a \(Q\)-polynomial distance-regular graph
- scientific article; zbMATH DE number 2163955 (Why is no real title available?)
- A class of distance-regular graphs that are \(\phi\)-polynomial
- A characterization of Q-polynomial distance-regular graphs
This page was built for publication: Distance-regular graphs of type \(E_1\circ E_d\) and the \(Q\)-polynomial property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3513650)