Recommendations
Cites work
- scientific article; zbMATH DE number 3926934 (Why is no real title available?)
- scientific article; zbMATH DE number 3668627 (Why is no real title available?)
- scientific article; zbMATH DE number 3733933 (Why is no real title available?)
- scientific article; zbMATH DE number 17098 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- scientific article; zbMATH DE number 51878 (Why is no real title available?)
- scientific article; zbMATH DE number 493043 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- A design and a code invariant under the simple group \(Co_ 3\)
- Distance regular covers of the complete graph
- Interlacing eigenvalues and graphs
- Regular 2-Graphs
- Regular two-graphs on 36 vertices
- Spreads and ovoids in finite generalized quadrangles
- Strongly regular graphs with smallest eigenvalue -m
- Strongly regular graphs with strongly regular decomposition
- The regular two-graph on 276 vertices
Cited in
(31)- Divisible design graphs from the symplectic graph
- On a class of quaternary complex Hadamard matrices
- Hoffman's coclique bound for normal regular digraphs, and nonsymmetric association schemes
- Jordan schemes
- Finding planted subgraphs with few eigenvalues using the Schur-Horn relaxation
- Three-class association schemes
- Some Bush-type Hadamard matrices
- Hoffman colorings of graphs
- 5-chromatic strongly regular graphs
- Quasi-symmetric \(2\)-\((64, 24, 46)\) designs derived from \(\mathrm{AG}(3, 4)\)
- The Hermitian two-graph and its code
- A two-fold cover of strongly regular graphs with spreads and association schemes of class five
- The 3-class association schemes connected with checkered Hadamard matrices of order 16
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
- Unbiased orthogonal designs
- There is no (75,32,10,16) strongly regular graph
- On cliques in edge-regular graphs
- Symmetric Bush-type generalized Hadamard matrices and association schemes
- Divisible design graphs
- Eigenspace embeddings of imprimitive association schemes
- Classification of three-class association schemes using backtracking with dynamic variable ordering
- On semidefinite programming relaxations of maximum \(k\)-section
- Spectral lower bounds for the quantum chromatic number of a graph. II
- Hoffman colorability of (strongly) regular graphs
- The chromatic index of strongly regular graphs
- Association schemes on 28 points as mergings of a half-homogeneous coherent configuration
- Implementing Brouwer's database of strongly regular graphs
- Recent progress in algebraic design theory
- On co-edge-regular graphs with 4 distinct eigenvalues
- Ball packings with high chromatic numbers from strongly regular graphs
This page was built for publication: Spreads in strongly regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q677166)
