Edge connectivity and the spectral gap of combinatorial and quantum graphs
arXiv:1702.05264 · doi:10.1088/1751-8121/aa8125
Abstract
We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph disconnected. On combinatorial graphs, one of the bounds is the well-known inequality of Fiedler, of which we give a new variational proof. On quantum graphs, the corresponding bound generalizes a recent result of Band and Lévy. All proofs are general enough to yield corresponding estimates for the -Laplacian and allow us to identify the minimizers. Based on the Betti number of the graph, we also derive upper and lower bounds on all eigenvalues which are "asymptotically correct", i.e. agree with the Weyl asymptotics for the eigenvalues of the quantum graph. In particular, the lower bounds improve the bounds of Friedlander on any given graph for all but finitely many eigenvalues, while the upper bounds improve recent results of Ariturk. Our estimates are also used to derive bounds on the eigenvalues of the normalized Laplacian matrix that improve known bounds of spectral graph theory.
References in corpus (7)
- Quantum Graphs: Applications to Quantum Chaos and Universal Spectral Statistics
- Negative energy ground states for the -critical NLSE on metric graphs
- On the Spectral Gap of a Quantum Graph
- Spectral gap for quantum graphs and their connectivity
- Parabolic theory of the discrete p-Laplace operator
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
- The first eigenvalue of the Laplacian on quantum graphs
Cited by in corpus (10)
- Limits of Quantum Graph Operators With Shrinking Edges
- Complex Quantum Networks: a Topical Review
- Quantum graphs which optimize the spectral gap
- Spectral Estimates for Infinite Quantum Graphs
- On Pleijel's nodal domain theorem for quantum graphs
- On the Decomposition of the Laplacian on Metric Graphs
- On extremal eigenvalues of the graph Laplacian
- Blind Graph Matching Using Graph Signals
- Interlacing and Friedlander-type inequalities for spectral minimal partitions of metric graphs
- Sturm-Liouville Problems And Global Bounds By Small Control Sets And applications to quantum graphs