Implementing Brouwer's database of strongly regular graphs
DOI10.1007/S10623-016-0264-XzbMATH Open1367.05214arXiv1601.00181OpenAlexW3123169012WikidataQ56859902 ScholiaQ56859902MaRDI QIDQ2364640FDOQ2364640
Authors: Nathann Cohen, Dmitrii V. Pasechnik 
Publication date: 21 July 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.00181
Recommendations
Searching and sorting (68P10) Association schemes, strongly regular graphs (05E30) Software, source code, etc. for problems pertaining to combinatorics (05-04) Software, source code, etc. for problems pertaining to computer science (68-04)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spectra of graphs
- The CRC handbook of combinatorial designs
- Finite generalized quadrangles
- Combinatorics. Room squares, sum-free sets, Hadamard matrices
- Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices
- On the \(p\)-rank of the adjacency matrices of strongly regular graphs
- Constructing two-weight codes with prescribed groups of automorphisms
- Uniqueness and nonexistence of some graphs related to \(M_{22}\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spreads in strongly regular graphs
- Strongly regular graphs
- Four Mutually Orthogonal Latin Squares of Order 14
- Existence of Five MOLS of Orders 18 and 60
- HEMISYSTEMS ON THE HERMITIAN SURFACE
- Combinatorics of symmetric designs
- Title not available (Why is that?)
- Tournaments and Hadamard matrices
- Examples of computer experimentation in algebraic combinatorics
- Title not available (Why is that?)
- On Borsuk's conjecture for two-distance sets
- A 64-dimensional counterexample to Borsuk's conjecture
- Strongly Regular Graphs Derived from Combinatorial Designs
- Strongly regular graphs with parameters \((4m^{4},2m^{4}+m^{2},m^{4}+m^{2},m^{4}+m^{2})\) exist for all \(m>1\)
- The regular two-graph on 276 vertices
- Classification of some strongly regular subgraphs of the McLaughlin graph
- Some new results on optimal codes over \(\mathbb F_5\)
- A new strongly regular graph
- Title not available (Why is that?)
- A skew Hadamard matrix of order 36
- A skew-Hadamard matrix of order 92
- Some classes of Hadamard matrices with constant diagonal
- Polarities of G. Higman's symmetric design and a strongly regular graph on 176 vertices
- Symmetric Conference Matrices of Order pq 2 + 1
- A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
- Symmetric Bush-type Hadamard matrices of order $4m^4$ exist for all odd $m$
- The existence of a Bush-type Hadamard matrix of order 324 and two new infinite classes of symmetric designs
- The uniqueness of the strongly regular graph \(\mathrm{srg}(105,32,4,12)\)
- Skew-symmetric association schemes with two classes and strongly regular graphs of type \(L_{2n-1}(4n-1)\)
- A block negacyclic Bush-type Hadamard matrix and two strongly regular graphs
- New families of strongly regular graphs
- Negative Latin square type partial difference sets and amorphic association schemes with Galois rings
- On a class of strongly regular designs and quasi-semisymmetric designs
Cited In (7)
- DiscreteZOO: a fingerprint database of discrete objects
- Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg}
- Wheeler graphs: a framework for BWT-based data structures
- Switching for small strongly regular graphs
- On some distance-regular graphs with many vertices
- House of Graphs: a database of interesting graphs
- A new family of partial difference sets in 3-groups
Uses Software
This page was built for publication: Implementing Brouwer's database of strongly regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364640)
