论文信息 - THE REGULAR TWO-GRAPH ON 276 VERTICES

THE REGULAR TWO-GRAPH ON 276 VERTICES

There is a unique regular two-graph on 276 vertices. This provides a characterization of Conway's group · 3. The proof is based on 276 = 3 × 11 + 35, and uses the ternary Golay code. The paper contains a list of the known strongly regular graphs with the eigenvalue −5.

J. M. Goethals

[1] J. Seidel. Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3 , 1968 .

[2] Philippe Delsarte,et al. Weights of linear codes and strongly regular normed spaces , 1972, Discret. Math..

[3] J. J. Seidel,et al. SYMMETRIC HADAMARD MATRICES OF ORDER 36 , 1970 .

[4] J. J. Seidel,et al. Strongly Regular Graphs Derived from Combinatorial Designs , 1970, Canadian Journal of Mathematics.

[5] V. Pless. On the uniqueness of the Golay codes , 1968 .