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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
