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 the maximum degree of a graph and its maximum and minimum adjacency eigenvalues. The case of equality is fully characterized.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.