In this note we show that the length spectrum for metric graphs exhibits a very high degree of degeneracy. More precisely, we obtain an asymptotic for the number of pairs of closed geodesics (or closed cycles) with the same metric length.
Mathematics Subject Classification
IntroductionLet G = (V, E) be a finite (connected) graph with vertices V and edges E. We write E o for the set of oriented edges; for e ∈ E o ,ē ∈ E o denotes the same unoriented edge with orientation reversed. (In the physics literature, the vertices are referred to as nodes and the edges as bonds.) The degree deg(v) of a vertex v is the number of outgoing oriented edges. A path in G is a sequence of successive oriented edges and is called non-backtracking if an oriented edge e is not immediately followed byē. A path is called closed if it returns to its starting point. A closed geodesic on G is a closed non-backtracking path, modulo the obvious cyclic permutation and we denote the (countable) set of closed geodesics by C. For γ ∈ C, we write |γ | for the number of edges it traverses.We make G into a metric graph by giving each edge e ∈ E a length l(e) > 0 and thus identifying it with the interval [0, l(e)]. (We may also regard l as a function on E o satisfying l(ē) = l(e).) For γ ∈ C, we define the metric length l(γ ) to be the sum of the lengths of the edges it traverses.We impose two assumptions on G and l:Assumption 1 Each vertex has degree at least 3.