Eigenvalue multiplicities of highly symmetric graphs
From MaRDI portal
Publication:1169483
DOI10.1016/0012-365X(82)90025-5zbMath0495.05045MaRDI 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
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Unnamed Item, Extremal Graph Realizations and Graph Laplacian Eigenvalues, On distance-regular graphs with fixed valency, On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency, Distance-regular graphs with light tails, There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three, A new feasibility condition for distance-regular graphs, Bounding the diameter of distance. Regular graphs, The distance-regular graphs of valency four, Some interlacing results for the eigenvalues of distance-regular graphs, There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10, On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7, A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph, Geometric aspects of 2-walk-regular graphs, 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, Two theorems concerning the Bannai-Ito conjecture, On quasi-strongly regular graphs
Cites Work
