Most Laplacian eigenvalues of a tree are small
Combinatorics
2020-08-05 v3
Abstract
We show that the number of Laplacian eigenvalues greater than the average degree of a tree having vertices is at most .
Keywords
Cite
@article{arxiv.1907.00234,
title = {Most Laplacian eigenvalues of a tree are small},
author = {David P. Jacobs and Elismar R. Oliveira and Vilmar Trevisan},
journal= {arXiv preprint arXiv:1907.00234},
year = {2020}
}
Comments
31 pages, 27 figures, accepted for publication in JCTB