On the sharpness of spectral estimates for graph Laplacians

DOI10.1016/S0034-4877(18)30071-5zbMath1402.81160OpenAlexW2895470087MaRDI QIDQ1626339

Pavel Kurasov, Andrea Serio

Publication date: 27 November 2018

Published in: Reports on Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0034-4877(18)30071-5

zbMATH Keywords

quantum graphsspectral estimates

Mathematics Subject Classification ID

Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

Related Items (5)

Quantum trees which maximize higher eigenvalues are unbalanced ⋮ Sturm-Liouville problems and global bounds by small control sets and applications to quantum graphs ⋮ Asymptotics and estimates for spectral minimal partitions of metric graphs ⋮ Interlacing and Friedlander-type inequalities for spectral minimal partitions of metric graphs ⋮ On extremal eigenvalues of the graph Laplacian ^*

Cites Work

• Unnamed Item
• Unnamed Item
• Rayleigh estimates for differential operators on graphs
• Spectral analysis on graph-like spaces
• Extremal properties of eigenvalues for a metric graph.
• A characteristic equation associated to an eigenvalue problem on \(c^ 2\)-networks
• Spectral gap for quantum graphs and their edge connectivity
• Edge connectivity and the spectral gap of combinatorial and quantum graphs
• Inverse spectral problem for quantum graphs
• Dependence of the spectrum of a quantum graph on vertex conditions and edge lengths

This page was built for publication: On the sharpness of spectral estimates for graph Laplacians