Home
For authors
Submission status

Current
Archive (English)
Archive
   Volumes 81-92
   Volumes 41-60
   Volumes 21-40
   Volumes 1-20
   Volumes 61-80
      Volume 80
      Volume 79
      Volume 78
      Volume 77
      Volume 76
      Volume 75
      Volume 74
      Volume 73
      Volume 72
      Volume 71
      Volume 70
      Volume 69
      Volume 68
      Volume 67
      Volume 66
      Volume 65
      Volume 64
      Volume 63
      Volume 62
      Volume 61
Search
VOLUME 77 (2003) | ISSUE 9 | PAGE 629
Solution of scaling quantum networks
PACS: 05.45.Mt
Abstract
We show that all scaling quantum graphs are explicitly integrable, i.e. 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 E9, 523 (2001)).