The regular two-graph on 276 vertices

J.M. Goethals; J.J. Seidel

doi:10.1016/0012-365X(75)90029-1

The regular two-graph on 276 vertices

J.M. Goethals, J.J. Seidel

Mathematics and Computer Science

Research output: Contribution to journal › Article › Academic › peer-review

60 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	143-158
Number of pages	16
Journal	Discrete Mathematics
Volume	12
Issue number	2
DOIs	https://doi.org/10.1016/0012-365X(75)90029-1
Publication status	Published - 1975

Access to Document

10.1016/0012-365X(75)90029-1

Cite this

@article{865059881ed14cf4a5305f347aff4c94,

title = "The regular two-graph on 276 vertices",

abstract = "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.",

author = "J.M. Goethals and J.J. Seidel",

year = "1975",

doi = "10.1016/0012-365X(75)90029-1",

language = "English",

volume = "12",

pages = "143--158",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - The regular two-graph on 276 vertices

AU - Goethals, J.M.

AU - Seidel, J.J.

PY - 1975

Y1 - 1975

N2 - 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.

AB - 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.

U2 - 10.1016/0012-365X(75)90029-1

DO - 10.1016/0012-365X(75)90029-1

M3 - Article

SN - 0012-365X

VL - 12

SP - 143

EP - 158

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 2

ER -

The regular two-graph on 276 vertices

Abstract

Access to Document

Fingerprint

Cite this