Recovering the shape of a quantum graph (Q2191097)

The paper studies the inverse problem for equilateral quantum graphs with a small number of vertices. The Schrödinger operator on an equilateral metric graph with Kirchhoff's matching conditions is considered. The questions investigated in the paper are the following: finding the shape of the graph from its spectrum and recovering the potential on the edges from the spectrum and the shape of the graph. The authors find the eigenvalue asymptotics for simple connected graphs which are not trees. For trees they prove that the eigenvalues of the problem with a non-zero potential asymptotically approach to the eigenvalues of the problem without potential. For graphs without potential and the number of vertices smaller or equal to 5 the authors prove that the shape of the graph is uniquely determined by their spectra. A similar result is obtained for tree graphs without potential and with the number of vertices smaller or equal to 8. Finally, the last result of the paper is a generalization of the geometric Ambarzumian's theorem proven in [\textit{J. Boman} et al., Integral Equations Oper. Theory 90, No. 3, Paper No. 40, 24 p. (2018; Zbl 1403.34030)]. The authors prove that, if the spectrum is the same as in the case without potential and the number of vertices is smaller or equal to the above values, the shape of the graph is uniquely determined and the potential is indeed zero.