Switching methods of level 2 for the construction of cospectral graphs
Authors:
- Aida AbiadAAAida Abiad
- Nils Van de BergNBNils Van de Berg
- Robin SimoensRSRobin Simoens
Open Access
- 26 August 2026
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 753, 242-272
Abstract
No abstract availableAll Related Versions
Funding Information
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek (VI.Vidi.213.085)
This publication has 22 references indexed in Scilit:
- Constructing cospectral graphs via regular rational orthogonal matrices with level twoDiscrete Mathematics, 2022
- Graphs cospectral with NU(n + 1,q2), n ≠ 3Discrete Mathematics, 2021
- Graph switching, 2-ranks, and graphical Hadamard matricesDiscrete Mathematics, 2019
- Godsil–McKay switching and twisted Grassmann graphsDesigns, Codes and Cryptography, 2016
- Switched symplectic graphs and their 2-ranksDesigns, Codes and Cryptography, 2015
- Cospectral regular graphs with and without a perfect matchingDiscrete Mathematics, 2015
- On the asymptotic behavior of graphs determined by their generalized spectraDiscrete Mathematics, 2010
- Developments on spectral characterizations of graphsDiscrete Mathematics, 2009
- Constructing cospectral graphsAequationes mathematicae, 1982
- A note on cospectral graphsJournal of Combinatorial Theory, Series B, 1980