Trace formulae for graph Laplacians with applications to recovering matching conditions
Abstract
Graph Laplacians on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of either δ or δ' 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.