Spectral gap for quantum graphs and their edge connectivity
From MaRDI portal
Publication:5326010
Abstract: The spectral gap for Laplace operators on metric graphs is investigated in relation to graph's connectivity, in particular what happens if an edge is added to (or deleted from) a graph. It is shown that in contrast to discrete graphs connection between the connectivity and the spectral gap is not one-to-one. The size of the spectral gap depends not only on the topology of the metric graph but on its geometric properties as well. It is shown that adding sufficiently large edges as well as cutting away sufficiently small edges leads to a decrease of the spectral gap. Corresponding explicit criteria are given.
Recommendations
- Edge connectivity and the spectral gap of combinatorial and quantum graphs
- On the spectral gap of a quantum graph
- Quantum graphs which optimize the spectral gap
- scientific article; zbMATH DE number 6770835
- Sharp diameter bound on the spectral gap for quantum graphs
- Spectral inequalities for quantum graphs
- Connectivity for quantum graphs
- On the essential spectrum of quantum graphs
- Periodic quantum graphs with predefined spectral gaps
- Spectral asymptotics for quantum graphs with equal edge lengths
Cited in
(38)- Impediments to diffusion in quantum graphs: Geometry-based upper bounds on the spectral gap
- Edge connectivity and the spectral gap of combinatorial and quantum graphs
- Rényi and Tsallis entropies related to eigenfunctions of quantum graphs
- Isospectral graphs via inner symmetries
- \(n\)-Laplacians on metric graphs and almost periodic functions. I
- On the eigenvalues of weighted directed graphs
- Spectral asymptotics for quantum graphs with equal edge lengths
- Edge switching transformations of quantum graphs: a scattering approach
- On the hot spots of quantum graphs
- Eigenvalue estimates for the Laplacian on a metric tree
- Sharp diameter bound on the spectral gap for quantum graphs
- Isospectrality for graph Laplacians under the change of coupling at graph vertices
- A theory of spectral partitions of metric graphs
- Quantum graphs which optimize the spectral gap
- scientific article; zbMATH DE number 6770835 (Why is no real title available?)
- Spectral gap of the discrete Laplacian on triangulations
- Optimal potentials for quantum graphs
- Spectral monotonicity for Schrödinger operators on metric graphs
- Schrödinger operators on graphs: symmetrization and Eulerian cycles
- On the spectral gap of a quantum graph
- Quantum trees which maximize higher eigenvalues are unbalanced
- Optimizing the fundamental eigenvalue gap of quantum graphs
- The first eigenvalue of the p-Laplacian on quantum graphs
- The spectrum of the Hilbert space valued second derivative with general self-adjoint boundary conditions
- Surgery transformations and spectral estimates of \(\delta\) beam operators
- Spectral gap of a weighted 3-simplicial complex
- On the spectral gap in Andreev graphs
- On crossroads of spectral theory with Sergey Naboko
- Mean distance on metric graphs
- Surgery principles for the spectral analysis of quantum graphs
- Isospectrality for graph Laplacians under the change of coupling at graph vertices: necessary and sufficient conditions
- On the sharpness of spectral estimates for graph Laplacians
- Laplacians on bipartite metric graphs
- Spectral theory for Schrödinger operators on compact metric graphs with \(\delta\) and \(\delta '\) couplings: a survey
- 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
- The Krein-von Neumann extension for Schrödinger operators on metric graphs
This page was built for publication: Spectral gap for quantum graphs and their edge connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326010)
