Spreads in strongly regular graphs

DOI10.1007/BF00130574zbMath0870.05078MaRDI QIDQ677166

Willem H. Haemers, Vladimir D. Tonchev

Publication date: 28 August 1997

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

zbMATH Keywords

strongly regular graphs; partial geometries; spreads; graph colorings; linked designs; regular 2-graphs

Mathematics Subject Classification ID

05E30: Association schemes, strongly regular graphs

05B25: Combinatorial aspects of finite geometries

51E23: Spreads and packing problems in finite geometry

05C15: Coloring of graphs and hypergraphs

51E14: Finite partial geometries (general), nets, partial spreads

Related Items

5-chromatic strongly regular graphs, A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs, Three-class association schemes, The 3-class association schemes connected with checkered Hadamard matrices of order 16, The Hermitian two-graph and its code, Some Bush-type Hadamard matrices, On semidefinite programming relaxations of maximum \(k\)-section, Divisible design graphs, Recent progress in algebraic design theory, Classification of three-class association schemes using backtracking with dynamic variable ordering, Association schemes on 28 points as mergings of a half-homogeneous coherent configuration

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