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 $\lfloor \frac{n}{2}\rfloor$.

31 pages, 27 figures, accepted for publication in JCTB