Switched symplectic graphs and their 2-ranks

DOI10.1007/s10623-015-0127-xzbMath1343.05173OpenAlexW1615465815WikidataQ59460017 ScholiaQ59460017MaRDI QIDQ306047

Willem H. Haemers, Aida Abiad

Publication date: 31 August 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-015-0127-x

zbMATH Keywords

strongly regular graphHadamard matrixswitching2-ranksymplectic graphs

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Godsil-McKay switching and twisted Grassmann graphs ⋮ Isodual and Self-dual Codes from Graphs ⋮ Switching for Small Strongly Regular Graphs ⋮ A switching for all strongly regular collinearity graphs from polar spaces ⋮ Switched graphs of some strongly regular graphs related to the symplectic graph ⋮ A new construction of strongly regular graphs with parameters of the complement symplectic graph ⋮ Enumeration of cospectral and coinvariant graphs ⋮ New strongly regular graphs from finite geometries via switching ⋮ Graph switching, 2-ranks, and graphical Hadamard matrices ⋮ Hermitian adjacency matrix of the second kind for mixed graphs

Cites Work

• Unnamed Item
• Constructing cospectral graphs
• Spectra of graphs
• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• Uniqueness of strongly regular graphs having minimal \(p\)-rank
• Binary codes of strongly regular graphs

This page was built for publication: Switched symplectic graphs and their 2-ranks