We provide explicit upper bounds for the eigenvalues of the Laplacian on a finite metric tree subject to standard vertex conditions. The results include estimates depending on the average length of the edges or the diameter. In particular, we establish a sharp upper bound for the spectral gap, i.e. the smallest positive eigenvalue, and show that equilateral star graphs are the unique maximizers of the spectral gap among all trees of a given average length.
Eigenvalue estimates for the Laplacian on a metric tree
Published 2016 in arXiv: Spectral Theory
ABSTRACT
PUBLICATION RECORD
- Publication year
2016
- Venue
arXiv: Spectral Theory
- Publication date
2016-02-11
- Fields of study
Mathematics, Physics
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-19 of 19 references · Page 1 of 1
CITED BY
Showing 1-38 of 38 citing papers · Page 1 of 1