Counting cospectral graphs obtained via switching

DOI10.1016/J.DISC.2025.114775MaRDI QIDQ6883720zbMATH OpenFDO

Authors Aida Abiad, Nils van de Berg, Robin Simoens

Publication date 16 December 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114775

zbMATH Keywords

eigenvalueenumerationswitching

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• A construction of distance cospectral graphs
• A note on cospectral graphs
• A simple arithmetic criterion for graphs being determined by their generalized spectra
• A sufficient condition for a family of graphs being determined by their generalized spectra
• Asymmetric graphs
• Characterizing distance-regularity of graphs by the spectrum
• Constructing cospectral graphs
• Constructing cospectral graphs via regular rational orthogonal matrix with level two and three
• Constructions of cospectral graphs with different zero forcing numbers
• Cospectral graphs and regular orthogonal matrices of level 2
• Cospectral graphs on 12 vertices
• Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
• Cospectral regular graphs with and without a perfect matching
• Enumeration of cospectral and coinvariant graphs
• Enumeration of cospectral graphs.
• Exponentially many graphs are determined by their spectrum
• Generalized cospectral graphs with and without Hamiltonian cycles
• Godsil-McKay switching and isomorphism
• scientific article; zbMATH DE number 3966090 (Why is no real title available?)
• scientific article; zbMATH DE number 3411062 (Why is no real title available?)
• Kombinatorische Anzahlbestimmungen in Relationen
• New families of strongly regular graphs
• New strongly regular graphs from finite geometries via switching
• On a Conjecture of Godsil Concerning Controllable Random Graphs
• On a theorem of Godsil and McKay concerning the construction of cospectral graphs
• On the asymptotic behavior of graphs determined by their generalized spectra
• The smallest pair of cospectral cubic graphs with different chromatic indexes
• Which graphs are determined by their spectrum?

This page was built for publication: Counting cospectral graphs obtained via switching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883720)