Graphs with many valencies and few eigenvalues

zbMath1320.05082arXiv1405.3383MaRDI QIDQ5502153

van Dam, Edwin R., Zheng-Jiang Xia, Jack H. Koolen

Publication date: 17 August 2015

Full work available at URL: https://arxiv.org/abs/1405.3383

zbMATH Keywords

Seidel switchingeigenvalues of graphsregular two-graphsstrong graphsnon-regular graphsfew eigenvalues

Mathematics Subject Classification ID

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

Related Items (12)

The graphs with all but two eigenvalues equal to \(-2\) or 0 ⋮ Biregular graphs with three eigenvalues ⋮ On the multiplicity of the least signless Laplacian eigenvalue of a graph ⋮ A note on graphs with exactly two main eigenvalues ⋮ On regular graphs with four distinct eigenvalues ⋮ On the multiplicity of Laplacian eigenvalues for unicyclic graphs ⋮ On 2-equitable graphs ⋮ Graphs with two main and two plain eigenvalues ⋮ Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\) ⋮ Graphs with three eigenvalues and second largest eigenvalue at most 1 ⋮ Open problems in the spectral theory of signed graphs ⋮ The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5

This page was built for publication: Graphs with many valencies and few eigenvalues