Switched symplectic graphs and their 2-ranks

DOI10.1007/S10623-015-0127-XzbMATH Open1343.05173DBLPjournals/dcc/AbiadH16OpenAlexW1615465815WikidataQ59460017 ScholiaQ59460017MaRDI QIDQ306047FDOQ306047

Authors: Aida Abiad, Willem H. Haemers 

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

Recommendations

• Switched graphs of some strongly regular graphs related to the symplectic graph
• Symplectic graphs modulo \(pq\)
• Graph switching, 2-ranks, and graphical Hadamard matrices
• Strongly regular graphs with the same parameters as the symplectic graph
• Switching for small strongly regular graphs

zbMATH Keywords

strongly regular graphHadamard matrixswitching2-ranksymplectic graphs

Mathematics Subject Classification ID

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

Cites Work

• Spectra of graphs
• Constructing cospectral 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
• Title not available (Why is that?)

Cited In (12)

• New strongly regular graphs from finite geometries via switching
• Graph switching, 2-ranks, and graphical Hadamard matrices
• Isodual and self-dual codes from graphs
• Enumeration of cospectral and coinvariant graphs
• Switching for small strongly regular graphs
• Godsil-McKay switching and twisted Grassmann graphs
• 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
• A switching for all strongly regular collinearity graphs from polar spaces
• Strongly regular graphs with the same parameters as the symplectic graph
• Hermitian adjacency matrix of the second kind for mixed graphs
• 2-swappable graphs

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

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