Spreads in strongly regular graphs

DOI10.1007/BF00130574zbMath0870.05078OpenAlexW2124923827MaRDI QIDQ677166

Vladimir D. Tonchev, Willem H. Haemers

Publication date: 28 August 1997

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00130574

zbMATH Keywords

strongly regular graphspartial geometriesspreadsgraph coloringslinked designsregular 2-graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Combinatorial aspects of finite geometries (05B25) Spreads and packing problems in finite geometry (51E23) Coloring of graphs and hypergraphs (05C15) Finite partial geometries (general), nets, partial spreads (51E14)

Related Items

Some Bush-type Hadamard matrices ⋮ Implementing Brouwer's database of strongly regular graphs ⋮ Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems ⋮ Unbiased orthogonal designs ⋮ 5-chromatic strongly regular graphs ⋮ Association schemes on 28 points as mergings of a half-homogeneous coherent configuration ⋮ Jordan schemes ⋮ A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs ⋮ On semidefinite programming relaxations of maximum \(k\)-section ⋮ On a class of quaternary complex Hadamard matrices ⋮ Symmetric Bush-type generalized Hadamard matrices and association schemes ⋮ Divisible design graphs ⋮ Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation ⋮ Spectral lower bounds for the quantum chromatic number of a graph. II ⋮ On cliques in edge-regular graphs ⋮ Ball packings with high chromatic numbers from strongly regular graphs ⋮ Quasi-symmetric \(2\)-\((64, 24, 46)\) designs derived from \(\mathrm{AG}(3, 4)\) ⋮ There is no (75,32,10,16) strongly regular graph ⋮ A two-fold cover of strongly regular graphs with spreads and association schemes of class five ⋮ The chromatic index of strongly regular graphs ⋮ Recent progress in algebraic design theory ⋮ Three-class association schemes ⋮ Classification of three-class association schemes using backtracking with dynamic variable ordering ⋮ The 3-class association schemes connected with checkered Hadamard matrices of order 16 ⋮ The Hermitian two-graph and its code ⋮ Hoffman’s Coclique Bound for Normal Regular Digraphs, and Nonsymmetric Association Schemes

Cites Work

• Distance regular covers of the complete graph
• The regular two-graph on 276 vertices
• Strongly regular graphs with smallest eigenvalue -m
• Spreads and ovoids in finite generalized quadrangles
• A design and a code invariant under the simple group \(Co_ 3\)
• Regular two-graphs on 36 vertices
• Interlacing eigenvalues and graphs
• Strongly regular graphs with strongly regular decomposition
• Regular 2-Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Spreads in strongly regular graphs