A class of distance-regular graphs that are \(\phi\)-polynomial

DOI10.1016/0095-8956(86)90078-XzbMath0579.05029MaRDI QIDQ1066908

Paul M. Terwilliger

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

Johnson graphhalved graphantipodal quotient

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (5)

Exceptional graphs with smallest eigenvalue -2 and related problems ⋮ The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs ⋮ Leonard triples, the Racah algebra, and some distance-regular graphs of Racah type ⋮ The subconstituent algebra of an association scheme. I ⋮ On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes

Cites Work

• Parameters of association schemes that are both P- and Q-polynomial
• Distance-regular graphs with girth 3 or 4: I
• A new feasibility condition for distance-regular graphs
• Characterization of H(n,q) by the parameters
• Strongly regular graphs with smallest eigenvalue -m
• Root systems and the Johnson and Hamming graphs
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Antipodal covering graphs
• Characerization of a class of distance regular graphs.
• Some q-Krawtchouk Polynomials on Chevalley Groups
• Orthogonal Polynomials, Duality and Association Schemes
• Locally petersen graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A class of distance-regular graphs that are \(\phi\)-polynomial