Spreads in Strongly Regular Graphs

Authors:
Willem H. Haemers;Vladimir D. Tonchev
Affiliations:
Tilburg University, Tilburg, The Netherlands;Michigan Technological University, Houghton, MI 49931, USA
Venue:
Designs, Codes and Cryptography - Special issue dedicated to Hanfried Lenz
Year:
1996

Citing 4
Cited 8

Design theory

Design theory
Distance regular covers of the complete graph

Journal of Combinatorial Theory Series B
A design and a code invariant under the simple group Co3

Journal of Combinatorial Theory Series A
Designs, Graphs, Codes, and Their Links

Designs, Graphs, Codes, and Their Links

Three-Class Association Schemes

Journal of Algebraic Combinatorics: An International Journal
The Existence of a Bush-Type Hadamard Matrix of Order 324 and Two New Infinite Classes of Symmetric Designs

Designs, Codes and Cryptography
The Search for Pseudo Orthogonal Latin Squares of OrderSix

Designs, Codes and Cryptography
A generalization of Wallis-Fon-Der-Flaass construction of strongly regular graphs

Journal of Algebraic Combinatorics: An International Journal
Association schemes on 28 points as mergings of a half-homogeneous coherent configuration

European Journal of Combinatorics
Divisible design graphs

Journal of Combinatorial Theory Series A
Recent progress in algebraic design theory

Finite Fields and Their Applications
Bounds on s-Distance Sets with Strength t

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A spread of a strongly regular graph is a partitionof the vertex set into cliques that meet Delsarte's bound (alsocalled Hoffman's bound). Such spreads give rise to coloringsmeeting Hoffman's lower bound for the chromatic number and tocertain imprimitive three-class association schemes. These correspondenceslead to conditions for existence. Most examples come from spreadsand fans in (partial) geometries. We give other examples, includinga spread in the McLaughlin graph. For strongly regular graphsrelated to regular two-graphs, spreads give lower bounds forthe number of non-isomorphic strongly regular graphs in the switchingclass of the regular two-graph.