Switching graphs and Hadamard matrices

DOI10.26493/2590-9770.1840.C3UMaRDI QIDQ7321939zbMATH OpenFDO

Authors Aida Abiad, Louka Peters

Publication date 31 August 2026

Published in The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.26493/2590-9770.1840.C3U

Mathematics Subject Classification ID

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

Cites work

• Constructing cospectral graphs
• Cospectral graphs and regular orthogonal matrices of level 2
• Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
• Cospectral mates for generalized Johnson and Grassmann graphs
• Cospectral mates for the union of some classes in the Johnson association scheme
• Graph switching, 2-ranks, and graphical Hadamard matrices
• Graphs cospectral with Kneser graphs
• Hadamard equivalence via graph isomorphism
• Hadamard matrices and their applications
• Large-determinant sign matrices of order 4k+1
• On a theorem of Godsil and McKay concerning the construction of cospectral graphs
• On the enumeration of some D-optimal designs
• Strongly regular graphs with the same parameters as the symplectic graph
• Switched symplectic graphs and their 2-ranks
• Switching codes and designs
• Switching Operations for Hadamard Matrices
• Which graphs are determined by their spectrum?

This page was built for publication: Switching graphs and Hadamard matrices

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