Solution of scaling quantum networks

We show that all scaling quantum graphs are explicitly solvable, i.e., that any one of their spectral eigenvalues En is computable analytically, explicitly, and individually for any given n. This is surprising, since quantum graphs are excellent models of quantum chaos (see, e.g., T. Kottos and H. Schanz, Physica E 9, 523 (2001)).