Note on the product of the largest and the smallest eigenvalue of a graph
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929248780943360 |
|---|---|
| author | Abiad, Aida Dalfó, Cristina Fiol, Miquel Àngel |
| author_facet | Abiad, Aida Dalfó, Cristina Fiol, Miquel Àngel |
| contents | In this note, we use eigenvalue interlacing to derive an inequality between the maximum degree of a graph and its maximum and minimum adjacency eigenvalues. The case of equality is fully characterized. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_12915 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Note on the product of the largest and the smallest eigenvalue of a graph Abiad, Aida Dalfó, Cristina Fiol, Miquel Àngel Combinatorics In this note, we use eigenvalue interlacing to derive an inequality between the maximum degree of a graph and its maximum and minimum adjacency eigenvalues. The case of equality is fully characterized. |
| title | Note on the product of the largest and the smallest eigenvalue of a graph |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2402.12915 |