Most Laplacian eigenvalues of a tree are small

David P. Jacobs, Elismar R. Oliveira, Vilmar Trevisan

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$.