Upper Eigenvalue Bounds for the Kirchhoff Laplacian on Embbeded Metric Graphs

Abstract

We derive upper bounds for the eigenvalues of the Kirchhoff Laplacian on a compact metric graph depending on the graph's genus g. These bounds can be further improved if $g=0$, i.e. if the metric graph is planar. Our results are based on a spectral correspondence between the Kirchhoff Laplacian and a particular a certain combinatorial weighted Laplacian. In order to take advantage of this correspondence, we also prove new estimates for the eigenvalues of the weighted combinatorial Laplacians that were previously known only in the weighted case.

arXiv comment27 pages, 7 figures

References in corpus (6)

• On the Spectral Gap of a Quantum Graph
• The normalized Laplacian spectrum of subdivisions of a graph
• Spectral Theory of Infinite Quantum Graphs
• On the Moduli Space of Singular Euclidean Surfaces
• What is actually a metric graph?
• Metric Poincaré type inequalities and lower bounds on the infimum of the spectrum for graphs