Abstract
On a compact metric graph, we consider the spectrum of the Laplacian defined with a mix of standard and Dirichlet vertex conditions. A Cheeger-type lower bound on the gap λ2−λ1 is established, with a constant that depends only on the total length of the graph and minimum edge length. We also prove some improvements of known upper bounds for eigenvalue gaps and ratios for metric trees and extensions to certain other types of graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
