Most Laplacian eigenvalues of a tree are small
Abstract
We show that the number of Laplacian eigenvalues greater than the average degree of a tree having n vertices is at most n2 .
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.