Graph switching, 2-ranks, and graphical Hadamard matrices

DOI10.1016/j.disc.2018.11.022zbMath1417.05247arXiv1801.01149OpenAlexW2963644876MaRDI QIDQ2317657

Aida Abiad, Steve Butler, Willem H. Haemers

Publication date: 12 August 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.01149

zbMATH Keywords

strongly regular graphSeidel switchingHadamard matrix2-rankGodsil-Mckay switching

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30)

Related Items

Unit gain graphs with two distinct eigenvalues and systems of lines in complex space ⋮ Switching for 2-designs ⋮ New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs ⋮ Switching for Small Strongly Regular Graphs ⋮ Godsil-McKay switching for mixed and gain graphs over the circle group ⋮ New strongly regular graphs from finite geometries via switching ⋮ Constructing cospectral signed graphs

Cites Work

• Unnamed Item
• Switched symplectic graphs and their 2-ranks
• Strongly regular graphs defined by spreads
• Spectra of graphs
• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• Strongly regular graphs with maximal energy
• Uniqueness of strongly regular graphs having minimal \(p\)-rank
• Binary codes of strongly regular graphs
• A switching for all strongly regular collinearity graphs from polar spaces