Distance-regular graphs of type E₁ E_d and the Q-polynomial property

MaRDI QIDQ3513650zbMATH OpenFDO

Authors Hong You, Suogang Gao

Publication date 6 August 2008

zbMATH Keywords

\(Q\)-polynomialcosine sequencesdistance-regular graphsKrein parameters

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

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 with strongly regular graphs _2 and _3

Cited in

(8)

• A class of distance-regular graphs that are \(\phi\)-polynomial
• Distance-regular graphs with \(b_ i=c_{d-i}\) and two P-polynomial structures
• Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph
• The Norton algebra of a \(Q\)-polynomial distance-regular graph
• scientific article; zbMATH DE number 2163955 (Why is no real title available?)
• Tight distance-regular graphs and the Q-polynomial property
• A Q-polynomial structure associated with the projective geometry L_N (q)
• 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)