A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
DOI10.1007/978-3-030-44097-8_11zbMath1473.81070arXiv1807.08185OpenAlexW2979287585MaRDI QIDQ5126341
No author found.
Publication date: 16 October 2020
Published in: Discrete and Continuous Models in the Theory of Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.08185
Estimates of eigenvalues in context of PDEs (35P15) Boundary value problems on graphs and networks for ordinary differential equations (34B45) Eigenvalues, estimation of eigenvalues, upper and lower bounds of ordinary differential operators (34L15) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- On the spectral gap of a quantum graph
- Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
- Rayleigh estimates for differential operators on graphs
- The number of nodal domains on quantum graphs as a stability index of graph partitions
- NLS ground states on graphs
- Pucci eigenvalues on geodesic balls
- The first eigenvalue of the \(p-\)Laplacian on quantum graphs
- Negative energy ground states for the \(L^{2}\)-critical NLSE on metric graphs
- Existence of infinitely many stationary solutions of the \(L^{2}\)-subcritical and critical NLSE on compact metric graphs
- A lower bound for nodal count on discrete and metric graphs
- Eigenvalues, diameter, and mean distance in graphs
- Minimization problems for eigenvalues of the Laplacian.
- The Laplacian with Wentzell-Robin boundary conditions on spaces of continuous functions
- Quantum graphs which optimize the spectral gap
- Extremal properties of eigenvalues for a metric graph.
- Genericity of simple eigenvalues for a metric graph
- Semi-classical measures on quantum graphs and the Gauß map of the determinant manifold
- Semigroup methods for evolution equations on networks
- Lack of Ground State for NLSE on Bridge-Type Graphs
- Eigenvalue estimates for the Laplacian on a metric tree
- Shape optimization and spectral theory
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Surgery principles for the spectral analysis of quantum graphs
- Dynamic and generalized Wentzell node conditions for network equations
- Spectral gap for quantum graphs and their edge connectivity
- 10 Nodal and spectral minimal partitions – The state of the art in 2016 –
- Edge connectivity and the spectral gap of combinatorial and quantum graphs
- Isoperimetric Inequalities and Their Applications
This page was built for publication: A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
