Large families of cospectral graphs

DOI10.1023/A:1008352030960zbMath0972.05033OpenAlexW1511107242MaRDI QIDQ5926324

Seress, Ákos

Publication date: 13 November 2001

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008352030960

zbMATH Keywords

Seidel switching

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (11)

Graphs determined by polynomial invariants ⋮ Spectra of bowtie product of graphs ⋮ Constructing cospectral graphs via a new form of graph product ⋮ Which graphs are determined by their spectrum? ⋮ Three distance characteristic polynomials of some graphs ⋮ A large family of cospectral Cayley graphs over dicyclic groups ⋮ A large family of cospectral Cayley graphs over dihedral groups ⋮ A sufficient condition for a family of graphs being determined by their generalized spectra ⋮ Spectra of \(M\)-edge rooted product of graphs ⋮ Aα and Lα-spectral properties of spider graphs ⋮ Spectra of M-rooted product of graphs

This page was built for publication: Large families of cospectral graphs