Graphs with three distinct eigenvalues and largest eigenvalue less than 8

DOI10.1016/j.laa.2008.11.028zbMath1225.05161OpenAlexW2110183614MaRDI QIDQ1014470

J. Martínez

Publication date: 29 April 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.11.028

zbMATH Keywords

strongly regular graphsintegral graphsspectra of graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Biregular graphs with three eigenvalues ⋮ On the distance spectrum of graphs ⋮ Equiangular lines in Euclidean spaces ⋮ Fluctuations in mean-field Ising models ⋮ Graphs whose certain polynomials have few distinct roots ⋮ Trees with Four and Five Distinct Signless Laplacian Eigenvalues ⋮ A note on graphs whose signless Laplacian has three distinct eigenvalues ⋮ Graphs with three eigenvalues and second largest eigenvalue at most 1 ⋮ Universal adjacency matrices with two eigenvalues ⋮ Graphs whose normalized Laplacian has three eigenvalues ⋮ Graphs with few distinct eigenvalues and extremal energy ⋮ Some new aspects of main eigenvalues of graphs

Cites Work

• Unnamed Item
• Multiplicative cones - a family of three eigenvalue graphs
• Line graphs, root systems, and elliptic geometry
• Nonregular graphs with three eigenvalues
• Which graphs are determined by their spectrum?
• On graphs with three eigenvalues
• Small regular graphs with four eigenvalues
• Regular graphs with four eigenvalues