Most Laplacian eigenvalues of a tree are small

preprint2020arXivOpen access

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Most Laplacian eigenvalues of a tree are small

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0