Skip to main content
SpringerLink
Log in

Large Families of Cospectral Graphs

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Seidel switching is an operation on graphs G satisfyingcertain regularity properties so that the resulting graph Hhas the same spectrum as G. If G issimple then the complement of G and the complementof H are also cospectral. We use a generalizationof Seidel switching to construct exponentially large familiesof cospectral graphs with cospectral complements.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Brooks, R. Gornet and W. H. Gustafson, Mutually isospectral Riemann surfaces, Adv. Math., Vol. 138 (1998) 306–322.

    Google Scholar 

  2. C. D. Godsil and B. D. McKay, Constructing cospectral graphs. Aequationes Math., Vol. 25 (1982) 257–268.

    Google Scholar 

  3. J. H. van Lint and J. J. Seidel, Equilateral point sets in elliptic geometry. Indag. Math., Vol. 28 (1966) 335–348.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Ohio State University, Columbus, OH 43210, USA

    Akos Seress

Authors
  1. Akos Seress
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Seress, A. Large Families of Cospectral Graphs. Designs, Codes and Cryptography 21, 205–208 (2000). https://doi.org/10.1023/A:1008352030960

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008352030960

Search

Navigation