Note on the product of the largest and the smallest eigenvalue of a graph
In this note, we use eigenvalue interlacing to derive an inequality between a graph’s maximum degree and its maximum and minimum adjacency eigenvalues. The equality case is fully characterized.
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2024-06-01
|
| Series: | Special Matrices |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/spma-2024-0008 |