Sharp diameter bound on the spectral gap for quantum graphs
classification
🧮 math.SP
keywords
bounddiametergraphsnumberquantumsharpspectralasymptotically
read the original abstract
We establish an upper bound on the spectral gap for compact quantum graphs which depends only on the diameter and total number of vertices. This bound is asymptotically sharp for pumpkin chains with number of edges tending to infinity.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.