Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs

DOI10.4171/JST/388zbMATH Open1484.35302arXiv2004.03230MaRDI QIDQ2078948FDOQ2078948

M. Plümer

Publication date: 4 March 2022

Published in: Journal of Spectral Theory (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2004.03230

zbMATH Keywords

Laplacianplanar graphsgraph embeddingsweighted graphsspectral geometryquantum graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Planar graphs; geometric and topological aspects of graph theory (05C10) Estimates of eigenvalues in context of PDEs (35P15) Boundary value problems on graphs and networks for ordinary differential equations (34B45) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Linear difference operators (47B39)

Cites Work

• Title not available (Why is that?)
• The spectrum of the continuous Laplacian on a graph
• A characteristic equation associated to an eigenvalue problem on \(c^ 2\)-networks
• Semigroup methods for evolution equations on networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Upper bounds for eigenvalues of conformal metrics
• An optimal Poincaré inequality for convex domains
• Graphs on surfaces
• Extremal properties of eigenvalues for a metric graph.
• Title not available (Why is that?)
• Conformal upper bounds for the eigenvalues of the Laplacian and Steklov problem
• Separators for sphere-packings and nearest neighbor graphs
• On the spectral gap of a quantum graph
• Title not available (Why is that?)
• Spectral partitioning works: planar graphs and finite element meshes
• Cheeger inequalities for unbounded graph Laplacians
• Eigenvalue estimates for the Laplacian on a metric tree
• Title not available (Why is that?)
• Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus
• Metric uniformization and spectral bounds for graphs
• Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
• Geometric Separators for Finite-Element Meshes
• Spectral estimates for infinite quantum graphs
• The normalized Laplacian spectrum of subdivisions of a graph
• Spectral theory of infinite quantum graphs
• Title not available (Why is that?)
• Edge connectivity and the spectral gap of combinatorial and quantum graphs
• Quantum graphs which optimize the spectral gap
• Sharp diameter bound on the spectral gap for quantum graphs
• A transfer principle and applications to eigenvalue estimates for graphs
• Lower estimates on eigenvalues of quantum graphs

Cited In (7)

• On torsional rigidity and ground-state energy of compact quantum graphs
• On extremal eigenvalues of the graph Laplacian ^*
• Upper bounds of the eigenvalues related to a weighted fractional \(p\)-Laplacian on metric graphs
• Quantum trees which maximize higher eigenvalues are unbalanced
• Bounds on the negative eigenvalues of Laplacians on finite metric graphs
• Spectral theory for Schrödinger operators on compact metric graphs with \(\delta\) and \(\delta '\) couplings: a survey
• Impediments to diffusion in quantum graphs: Geometry-based upper bounds on the spectral gap

This page was built for publication: Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2078948)