Graphs whose Laplacian eigenvalues are almost all 1 or 2
We explicitly determine all connected graphs whose Laplacian matrices have at most four eigenvalues different from 1 and 2.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2024-10-01
|
| Series: | Special Matrices |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/spma-2024-0015 |