Generation of isospectral graphs

  • Authors:

  • Lorenz Halbeisen;Norbert Hungerbühler

  • Affiliations:

  • U.C. Berkeley Berkeley, CA, USA;Max-Planck Institute for Mathematics, Leipzig, Germany

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

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