Note on the product of the largest and the smallest eigenvalue of a graph

Abstract

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.

Keywords

• interlacing
• eigenvalues
• maximum degree
• 05c25
• 05c50