Twice Q-polynomial distance-regular graphs are thin

DOI10.1016/0195-6698(95)90037-3zbMath0852.05085OpenAlexW2026970773MaRDI QIDQ1902962

Garth A. Dickie

Publication date: 25 November 1996

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0195-6698(95)90037-3

zbMATH Keywords

distance-regular graphthin graph\(Q\)-polynomial graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (28)

Twice \(Q\)-polynomial distance-regular graphs of diameter 4 ⋮ The subconstituent algebra of a strongly regular graph ⋮ Imprimitive Q-polynomial association schemes ⋮ Association schemes with multiple Q-polynomial structures ⋮ Parallelogram-free distance-regular graphs ⋮ Imprimitive cometric association schemes: constructions and analysis ⋮ On symmetric association schemes and associated quotient-polynomial graphs ⋮ The girth of a thin distance-regular graph ⋮ The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two ⋮ On bipartite \(Q\)-polynomial distance-regular graphs with diameter 9, 10, or 11 ⋮ The Terwilliger algebra of a distance-regular graph of negative type ⋮ A generalization of the Terwilliger algebra ⋮ The Terwilliger algebra of the hypercube ⋮ The Terwilliger algebra of an almost-bipartite \(P\)- and \(Q\)-polynomial association scheme ⋮ Taut distance-regular graphs and the subconstituent algebra ⋮ TD-pairs and the $q$-Onsager algebra ⋮ \(Q\)-polynomial distance-regular graphs with \(a_1=0\) and \(a_2\neq 0\) ⋮ Distance-regular graphs and the \(q\)-tetrahedron algebra ⋮ Distance-regular graphs of \(q\)-Racah type and the \(q\)-tetrahedron algebra ⋮ An inequality involving the local eigenvalues of a distance-regular graph ⋮ Distance-regular graphs which support a spin model are thin ⋮ The Terwilliger algebras of bipartite \(P\)- and \(Q\)-polynomial schemes ⋮ A distance regular graph of type \(E_1\circ E_d\) ⋮ Hypercube and tetrahedron algebra ⋮ The subconstituent algebra of a distance-regular graph; thin modules with endpoint one ⋮ The generalized Terwilliger algebra and its finite-dimensional modules when \(d=2\) ⋮ Tight distance-regular graphs and the subconstituent algebra ⋮ The parameters of bipartite \(Q\)-polynomial distance-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The subconstituent algebra of an association scheme. I
• The subconstituent algebra of an association scheme. III
• The subconstituent algebra of an association scheme. II
• A characterization of \(P\)- and \(Q\)-polynomial association schemes
• A new inequality for distance-regular graphs
• Twice Q-polynomial distance-regular graphs

This page was built for publication: Twice Q-polynomial distance-regular graphs are thin