1097-0118/asset/JGT_left.gif?v=1&s=1444a0be416c8f041967dd96201bc2e34f807002)
Generation of isospectral graphs
Article first published online: 21 JUL 1999
DOI: 10.1002/(SICI)1097-0118(199907)31:3<255::AID-JGT7>3.0.CO;2-6
Copyright © 1999 John Wiley & Sons, Inc.
1097-0118/asset/cover.gif?v=1&s=747ee645df081de59c78864878c8bdb9daeca9a1 "Journal of Graph Theory")
Additional Information
How to Cite
Halbeisen, L. and Hungerbühler, N. (1999), Generation of isospectral graphs. J. Graph Theory, 31: 255–265. doi: 10.1002/(SICI)1097-0118(199907)31:3<255::AID-JGT7>3.0.CO;2-6
Publication History
- Issue published online: 21 JUL 1999
- Article first published online: 21 JUL 1999
- Manuscript Revised: 28 MAR 1998
- Manuscript Received: 28 OCT 1996
- Abstract
- References
- Cited By
Keywords:
- isospectral graphs;
- laplace spectrum of graphs;
- Sunada's Theorem;
- transplantation technique
Abstract
We discuss a discrete version of Sunada's Theorem on isospectral manifolds, which allows the generation of isospectral simple graphs, i.e., nonisomorphic simple graphs that have the same Laplace spectrum. We also consider additional boundary conditions and Buser's transplantation technique applied to a discrete situation. © John Wiley & Sons, Inc. J Graph Theory 31: 255–265, 1999