Inverse spectral problem for quantum graphs with rationally dependent edges

In this paper we study the problem of unique reconstruction of the quantum graphs. The idea is based on the trace formula which establishes the relation between the spectrum of Laplace operator and the set of periodic orbits, the number of edges and the total length of the graph. We analyse conditions under which is it possible to reconstruct simple graphs containing edges with rationally dependent lengths