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 the maximum degree of a graph and its maximum and minimum adjacency eigenvalues. The case of equality is fully characterized.

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Abiad, Aida, Dalfó, Cristina, Fiol, Miquel Àngel
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 20.02.2024
Subjects
Eigenvalues
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2331-8422