Spreads in Strongly Regular Graphs

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.

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

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

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

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

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

[6]  Mohan S. Shrikhande,et al.  Strongly regular graphs with strongly regular decompositions , 1991 .

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

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

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

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

[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]  Willem H. Haemers,et al.  Strongly regular graphs with strongly regular decomposition , 1989 .

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

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

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