Edge connectivity and the spectral gap of combinatorial and quantum graphs

DOI10.1088/1751-8121/AA8125zbMATH Open1456.81193arXiv1702.05264OpenAlexW3099030523MaRDI QIDQ5369076FDOQ5369076

James Bernard Kennedy, Delio Mugnolo, Gregory Berkolaiko, Pavel Kurasov

Publication date: 12 October 2017

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

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'evy. All proofs are general enough to yield corresponding estimates for the $p$-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.

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

zbMATH Keywords

graphLaplacianquantum graphspectral gapSturm-Liouville problemspectral geometry

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) General topics in linear spectral theory for PDEs (35P05) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Sturm-Liouville theory (34B24)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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?)
• Eigenvalues, embeddings and generalised trigonometric functions
• NLS ground states on graphs
• Extremal properties of eigenvalues for a metric graph.
• Bounds on the (Laplacian) spectral radius of graphs
• Spectral gap for quantum graphs and their edge connectivity
• On the spectral gap of a quantum graph
• Title not available (Why is that?)
• Rayleigh estimates for differential operators on graphs
• The first eigenvalue of the \(p-\)Laplacian on quantum graphs
• Dependence of the spectrum of a quantum graph on vertex conditions and edge lengths
• Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
• Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
• Generalized extremal length of an infinite network
• Parabolic theory of the discrete \(p\)-Laplace operator
• Mini-workshop: Discrete \(p\)-Laplacians: spectral theory and variational methods in mathematics and computer science. Abstracts from the mini-workshop held February 8--14, 2015.
• Eigenvalue estimates for the Laplacian on a metric tree
• On the Laplacian eigenvalues of a graph
• Oscillation properties of the spectrum of a boundary value problem on a graph
• Variational and non-variational eigenvalues of the \(p\)-Laplacian
• Eigenvalue and nodal properties on quantum graph trees*
• Negative energy ground states for the \(L^{2}\)-critical NLSE on metric graphs
• Schrödinger operators on graphs: symmetrization and Eulerian cycles

Cited In (38)

• On the decomposition of the Laplacian on metric graphs
• On torsional rigidity and ground-state energy of compact quantum graphs
• On extremal eigenvalues of the graph Laplacian ^*
• Eigenvalue estimates for the Laplacian with anti-Kirchhoff conditions on a metric tree
• Complex quantum networks: a topical review
• Isospectral graphs via inner symmetries
• Lower estimates on eigenvalues of quantum graphs
• The adjacency matrix and the discrete Laplacian acting on forms
• Sturm-Liouville problems and global bounds by small control sets and applications to quantum graphs
• On the hot spots of quantum graphs
• Sharp diameter bound on the spectral gap for quantum graphs
• The discrete Laplacian acting on 2-forms and application
• Quantum graphs which optimize the spectral gap
• Spectral gap for quantum graphs and their edge connectivity
• Optimal potentials for quantum graphs
• Asymptotics and estimates for spectral minimal partitions of metric graphs
• Quantum trees which maximize higher eigenvalues are unbalanced
• Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs
• Surgery transformations and spectral estimates of \(\delta\) beam operators
• Interlacing and Friedlander-type inequalities for spectral minimal partitions of metric graphs
• On Pleijel's nodal domain theorem for quantum graphs
• Mean distance on metric graphs
• On the eigenvalues of quantum graph Laplacians with large complex \(\delta\) couplings
• Surgery principles for the spectral analysis of quantum graphs
• On the sharpness of spectral estimates for graph Laplacians
• Localized eigenvectors on metric graphs
• Spectral theory for Schrödinger operators on compact metric graphs with \(\delta\) and \(\delta '\) couplings: a survey
• On maximum Zagreb indices of bipartite graphs with a given connectivity
• On the \(p\)-torsional rigidity of combinatorial graphs
• Laplacians on bipartite metric graphs
• Limits of quantum graph operators with shrinking edges
• Gluing graphs and the spectral gap: a Titchmarsh–Weyl matrix-valued function approach
• A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
• Spectral estimates for infinite quantum graphs
• Quantum graphs via exercises
• The Krein-von Neumann extension for Schrödinger operators on metric graphs
• Edge switching transformations of quantum graphs—a scattering approach
• Spectral Monotonicity for Schrödinger Operators on Metric Graphs

This page was built for publication: Edge connectivity and the spectral gap of combinatorial and quantum graphs

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