Spreads in strongly regular graphs
A spread of a strongly regular graph is a partition of the vertex set into cliques that meet Delsarte's bound (also called Huffman's bound). Such spreads give rise to colorings meeting Hoffman's lower bound for the chromatic number and to certain imprimitive three-class association schemes. These correspondences lead to conditions for existence. Most examples come from spreads and fans in (partial) geometries. We give other examples, including a spread in the McLaughlin graph. For strongly regular graphs related to regular two-graphs, spreads give lower bounds for the number of non-isomorphic strongly regular graphs in the switching class of the regular two-graph.
Designs, Codes and Cryptography
Spreads in strongly regular graphs.
Designs, Codes and Cryptography,
Retrieved from: https://digitalcommons.mtu.edu/math-fp/156