Work

Switching graphs and Hadamard matrices

Year: 2025

Type: article

Abstract: Local operations of combinatorial structures (graphs, Hadamard matrices, codes, designs) that maintain the basic parameters unaltered, have been widely used in the literature under the name of switching. We show an equivalence between two switching methods to construct inequivalent Hadamard matrices, which were proposed by Orrick in 2008, and the switching method for constructing cospectral graphs which was introduced by Godsil and McKay in 1982.

Source: The Art of Discrete and Applied Mathematics

DOI: 10.26493/2590-9770.1840.c3u

Authors: Aida Abiad, Louka Peters

Institutions: Vrije Universiteit Brussel, Eindhoven University of Technology, Ghent University

Language: English

Topic: Finite Group Theory Research

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: diamond

Funder: Nederlandse Organisatie voor Wetenschappelijk Onderzoek

Award: Finding network structure beyond the spectrum: new frontiers and new methods