Trace formulae for graph Laplacians with applications to recovering matching conditions

Authors

  • A. V. Kiselev Institute of Mathematics, National Academy of Science of Ukraine, 3 Tereshchenkivs'ka, Kyiv, 01601, Ukraine
  • Yu. Ershova Department of Higher Mathematics and Mathematical Physics, St. Petersburg State University, 1 Ulianovskaya, St. Petersburg, St. Peterhoff, 198504, Russia 

DOI:

Keywords:

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.

Downloads

Published

2012-12-25

Issue

Section

Articles

How to Cite

Kiselev, A. V., and Yu. Ershova. “Trace Formulae for Graph Laplacians With Applications to Recovering Matching Conditions”. Methods of Functional Analysis and Topology, vol. 18, no. 4, Dec. 2012, pp. 343-59, https://zen.imath.kiev.ua/index.php/mfat/article/view/526.