Spreads in strongly regular graphs

DOI10.1007/BF00130574zbMATH Open0870.05078OpenAlexW2124923827MaRDI QIDQ677166FDOQ677166

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 graphsspreadsgraph coloringspartial geometrieslinked designsregular 2-graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (26)

• On a class of quaternary complex Hadamard matrices
• Jordan schemes
• Some Bush-type Hadamard matrices
• Three-class association schemes
• 5-chromatic strongly regular graphs
• Quasi-symmetric \(2\)-\((64, 24, 46)\) designs derived from \(\mathrm{AG}(3, 4)\)
• A two-fold cover of strongly regular graphs with spreads and association schemes of class five
• The Hermitian two-graph and its code
• 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
• Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation
• 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’s Coclique Bound for Normal Regular Digraphs, and Nonsymmetric Association Schemes
• 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
• 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)