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.

[1]  W. Haemers.  Eigenvalue techniques in design and graph theory , 1979 .

[2]  Chris D. Godsil,et al.  Distance regular covers of the complete graph , 1992, J. Comb. Theory, Ser. B.

[3]  J. H. Lint,et al.  Designs, graphs, codes, and their links , 1991 .

[4]  W. Haemers.  Interlacing eigenvalues and graphs , 1995 .

[5]  J. J. Seidel,et al.  The regular two-graph on 276 vertices , 1975, Discret. Math..

[6]  Yaotsu Chang.  Imprimitive symmetric rank 4 association schemes. , 1994 .

[7]  Peter J. Cameron,et al.  Designs, graphs, codes, and their links , 1991 .

[8]  A. Neumaier.  Strongly regular graphs with smallest eigenvalue —m , 1979 .

[9]  Willem H. Haemers,et al.  Strongly regular graphs with strongly regular decomposition , 1989 .

[10]  A. Neumaier,et al.  Distance Regular Graphs , 1989 .

[11]  W. H. Haemers,et al.  Finite Geometry and Combinatorics: There exists no (76,21,2,7) strongly regular graph , 1993 .

[12]  Vladimir D. Tonchev,et al.  A Design and a Code Invariant under the Simple Group Co3 , 1993, J. Comb. Theory, Ser. A.

[13]  Edward Spence,et al.  Regular two-graphs on 36 vertices , 1995 .

[14]  P. Cameron.  On groups with several doubly-transitive permutation representations , 1972 .

[15]  A. Rosa,et al.  Tables of Parameters of BIBDs with r⩽41 including Existence, Enumeration, and Resolvability Results , 1985 .

[16]  Joseph A. Thas,et al.  Spreads and ovoids in finite generalized quadrangles , 1994 .

[17]  A. J. Hoffman,et al.  ON EIGENVALUES AND COLORINGS OF GRAPHS, II , 1970 .

[18]  Hanfried Lenz,et al.  Design theory , 1985 .

[19]  D. E. Taylor.  Regular 2‐Graphs , 1977 .

[20]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .