Graph switching, 2-ranks, and graphical Hadamard matrices
Authors:
- Aida AbiadAAAida Abiad
- Steve ButlerSBSteve Butler
- Willem H. HaemersWHWillem H. Haemers
- 1 October 2019
- journal article
- conference paper
- Published by Elsevier in Discrete Mathematics
- Vol. 342 (10) , 2850-2855
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Simons Foundation (427264)
This publication has 7 references indexed in Scilit:
- A switching for all strongly regular collinearity graphs from polar spacesJournal of Algebraic Combinatorics, 2017
- Switched symplectic graphs and their 2-ranksDesigns, Codes and Cryptography, 2015
- Strongly regular graphs with maximal energyLinear Algebra and its Applications, 2008
- Binary Codes of Strongly Regular GraphsDesigns, Codes and Cryptography, 1999
- Uniqueness of strongly regular graphs having minimal p-rankLinear Algebra and its Applications, 1995
- On the p-Rank of the Adjacency Matrices of Strongly Regular GraphsJournal of Algebraic Combinatorics, 1992
- Strongly regular graphs defined by spreadsIsrael Journal of Mathematics, 1982