Premium
Generation of isospectral graphs
Author(s) -
Halbeisen Lorenz,
Hungerbühler Norbert
Publication year - 1999
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199907)31:3<255::aid-jgt7>3.0.co;2-6
Subject(s) - isospectral , mathematics , simple (philosophy) , combinatorics , discrete mathematics , graph , laplace transform , graph theory , pure mathematics , mathematical analysis , philosophy , epistemology
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