We show that families of leafless quantum graphs that are isospectral for the standard Laplacian are finite. We show that the minimum edge length is a spectral invariant. We give an upper bound for the size of isospectral families in terms of the total edge length of the quantum graphs.
We define the Bloch spectrum of a quantum graph to be the map that assigns to each element in the deRham cohomology the spectrum of an associated magnetic Schrödinger operator. We show that the Bloch spectrum determines the Albanese torus, the block structure and the planarity of the graph. It determines a geometric dual of a planar graph. This enables us to show that the Bloch spectrum identifies and completely determines planar 3-connected quantum graphs.
|Advisor:||Gordon, Carolyn S.|
|Commitee:||Kuchment, Peter, Sutton, Craig, Winkler, Pete|
|School Location:||United States -- New Hampshire|
|Source:||DAI-B 73/05, Dissertation Abstracts International|
|Subjects:||Applied Mathematics, Mathematics|
|Keywords:||Inverse spectra, Laplace operator on quantum graphs, Quantum graphs, Spectral geometry|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be