We discuss behaviour of the spectral gap for quantum graphs when two metric graphs are glued together. It appears that precise answer to this question can be given using a natural generalisation of the Titchmarsh-Weyl M-functions.
An introduction into the area of inverse problems for the Schrödinger operators on metric graphs is given. The case of metric finite trees is treated in detail with the focus on matching conditions. For graphs with loops we show that for almost all matching conditions the potential on the loop is not determined uniquely by the Titchmarsh-Weyl function. The class of all admissible potentials is characterized.
Quantum graphs having one cycle are considered. It is shown that if the cycle contains at least three vertices, then the potential on the graph can be uniquely reconstructed from the corresponding Titchmarsh-Weyl function (Dirichlet-to-Neumann map) associated with graph's boundary, provided certain non-resonant conditions are satisfied.
We discuss lower and upper estimates for the spectral gap of the Laplace operator on a finite compact connected metric graph. It is shown that the best lower estimate is given by the spectral gap for the interval with the same total length as the original graph. An explicit upper estimate is given by generalizing Cheeger's approach developed originally for Riemannian manifolds.
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.