Eigenvalue multiplicities of highly symmetric graphs
From MaRDI portal
Publication:1169483
DOI10.1016/0012-365X(82)90025-5zbMath0495.05045OpenAlexW2047441990MaRDI QIDQ1169483
Publication date: 1982
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(82)90025-5
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (18)
A new feasibility condition for distance-regular graphs ⋮ Two theorems concerning the Bannai-Ito conjecture ⋮ Bounding the diameter of distance. Regular graphs ⋮ A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph ⋮ Extremal Graph Realizations and Graph Laplacian Eigenvalues ⋮ Geometric aspects of 2-walk-regular graphs ⋮ On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency ⋮ Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3 ⋮ Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency ⋮ Some interlacing results for the eigenvalues of distance-regular graphs ⋮ On distance-regular graphs with fixed valency ⋮ Distance-regular graphs with light tails ⋮ There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three ⋮ Unnamed Item ⋮ There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10 ⋮ The distance-regular graphs of valency four ⋮ On quasi-strongly regular graphs ⋮ On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7
Cites Work
This page was built for publication: Eigenvalue multiplicities of highly symmetric graphs
