A new feasibility condition for distance-regular graphs

DOI10.1016/0012-365X(86)90102-0zbMath0606.05045OpenAlexW1993355682MaRDI QIDQ1084413

Paul M. Terwilliger

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(86)90102-0

zbMATH Keywords

distance-regular grapheigenvalues

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Related Items (22)

Distance-regular digraphs of girth 4 ⋮ On the multiplicity of eigenvalues of distance-regular graphs ⋮ The subconstituent algebra of a strongly regular graph ⋮ Bounding the diameter of distance. Regular graphs ⋮ Exceptional graphs with smallest eigenvalue -2 and related problems ⋮ Distance-regular graphs with classical parameters that support a uniform structure: case \(q \leq 1\) ⋮ Some results on the eigenvalues of distance-regular graphs ⋮ Geometric aspects of 2-walk-regular graphs ⋮ On Terwilliger graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph ⋮ Distance-regular graphs, pseudo primitive idempotents, and the Terwilliger algebra. ⋮ A characterization of Johnson and Hamming graphs and proof of Babai's conjecture ⋮ The distance-regular graphs such that all of its second largest local eigenvalues are at most one ⋮ Distance-regular graphs with light tails ⋮ On the spectral gap and the automorphism group of distance-regular graphs ⋮ Graphs in which neighborhoods of vertices are isomorphic to the Hoffman-Singleton graph ⋮ Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I ⋮ An inequality involving the local eigenvalues of a distance-regular graph ⋮ On distance-regular graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph ⋮ On graphs in which the neighborhood of each vertex is isomorphic to the Gewirtz graph ⋮ The subconstituent algebra of a distance-regular graph; thin modules with endpoint one ⋮ A class of distance-regular graphs that are \(\phi\)-polynomial ⋮ Tight distance-regular graphs and the subconstituent algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eigenvalue multiplicities of highly symmetric graphs
• Line graphs, root systems, and elliptic geometry
• A new 5‐arc‐transitive cubic graph

This page was built for publication: A new feasibility condition for distance-regular graphs