existence of co-spectral (iso-spectral) graphs is a well-known problem of the classical graph theory. However, co-spectral graphs exist in the theory of quantum graphs also. In other words, the spectrum of the Sturm-Liouville problem on a metric graph does not determine alone the shape of the graph. Сo-spectral trees also exist if the number of vertices exceeds eight. We consider two Sturm-Liouville spectral problems on an equilateral metric caterpillar tree with real L2 (0,l) potentials on the edges. In the first (Neumann) problem we impose standard conditions at all vertices: Neumann boundary conditions at the pendant vertices and continuity and Kirchhoff’s conditions at the interior vertices. The second (Dirichlet) problem differs from the first in that in the second problem we set the Dirichlet condition at the root (one of the pendant vertices of the stalk of the caterpillar tree, i.e. the central path of it). Using the asymptotics of the eigenvalues of these two spectra we find the determinant of the normalized Laplacian of the tree and the determinant of the prime submatrix of the normalized laplacian obtained by deleting the row and the column corresponding to the root. Expanding the fraction of these determinants into continued fraction we receive full information on the shape of the tree. In general case this continued fraction is branched. We prove that in the case of a caterpillar tree the continued fraction does not branch and the spectra of the Neumann and Dirichlet problems uniquely determine the shape of the tree. A concrete example is shown. The known pair of co-spectral trees with minimal number (eight) of vertices belongs to the class of caterpillar trees. Keywords: metric graph, tree, pendant vertex, interior vertex, edge, caterpillar tree, Sturm-Liouville equation, potential, eigenvalues, spectrum, Dirichlet boundary condition, Neumann boundary condition, root, continued fraction, adjacency matrix, prime submatrix, normalized Laplacian
Read full abstract