Graphs whose Laplacian eigenvalues are almost all 1 or 2

Abstract

We explicitly determine all connected graphs whose Laplacian matrices have at most four eigenvalues different from 1 and 2.

Keywords

• forbidden subgraph
• laplacian eigenvalue
• 05c50