Note on the product of the largest and the smallest eigenvalue of a graph
Combinatorics
2024-02-21 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2402.12915,
title = {Note on the product of the largest and the smallest eigenvalue of a graph},
author = {Aida Abiad and Cristina Dalfó and Miquel Àngel Fiol},
journal= {arXiv preprint arXiv:2402.12915},
year = {2024}
}