Trace formulae for graph Laplacians with applications to recovering matching conditions
classification
🧮 math-ph
math.MPmath.SP
keywords
graphconditionslaplaciansmatchingapplicationsdeltaeitherformulae
read the original abstract
Graph Laplacians on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of either $\delta$ or $\delta'$ type. In either case, an infinite series of trace formulae which link together two different graph Laplacians provided that their spectra coincide is derived. Applications are given to the problem of reconstructing matching conditions for a graph Laplacian based on its spectrum.
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.