Graphs with three eigenvalues and second largest eigenvalue at most 1

Abstract

We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenvalue at most 1.

20 pages

References in corpus (2)

• Biregular graphs with three eigenvalues
• Graphs with many valencies and few eigenvalues

Cited by in corpus (3)

• Quadratic Embedding Constants of Graph Joins
• On main eigenvalues of certain graphs
• Connected triangle-free planar graphs whose second largest eigenvalue is at most 1