The following pages link to Spreads in strongly regular graphs (Q677166):
Displaying 23 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- On cliques in edge-regular graphs (Q468702) (← links)
- Ball packings with high chromatic numbers from strongly regular graphs (Q526257) (← links)
- 5-chromatic strongly regular graphs (Q856856) (← links)
- A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs (Q871281) (← links)
- Symmetric Bush-type generalized Hadamard matrices and association schemes (Q897325) (← links)
- Three-class association schemes (Q1296390) (← links)
- The 3-class association schemes connected with checkered Hadamard matrices of order 16 (Q1587910) (← links)
- Unbiased orthogonal designs (Q1647571) (← links)
- On a class of quaternary complex Hadamard matrices (Q1685993) (← links)
- There is no (75,32,10,16) strongly regular graph (Q1790457) (← links)
- The Hermitian two-graph and its code (Q1855390) (← links)
- Some Bush-type Hadamard matrices (Q1873080) (← links)
- On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
- Quasi-symmetric \(2\)-\((64, 24, 46)\) designs derived from \(\mathrm{AG}(3, 4)\) (Q2012536) (← links)
- Jordan schemes (Q2164422) (← links)
- Spectral lower bounds for the quantum chromatic number of a graph. II (Q2215470) (← links)
- Implementing Brouwer's database of strongly regular graphs (Q2364640) (← links)
- Divisible design graphs (Q2431260) (← links)
- Recent progress in algebraic design theory (Q2566180) (← links)
- Classification of three-class association schemes using backtracking with dynamic variable ordering (Q2570104) (← links)
- Association schemes on 28 points as mergings of a half-homogeneous coherent configuration (Q2643847) (← links)
- The chromatic index of strongly regular graphs (Q3390046) (← links)
