Skip to main content
Article thumbnail
Location of Repository

The strongly regular (45,12,3,3) graphs

By K. Coolsaet, J. Degraer and E. Spence

Abstract

Using two backtrack algorithms based on dierent techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with parameters v = 45, k = 12, λ = μ = 3. It turns out that there are 78 such graphs, having automorphism groups with sizes ranging from 1 to 51840

Topics: QA
Publisher: American Mathematical Society
Year: 2006
OAI identifier: oai:eprints.gla.ac.uk:12858
Provided by: Enlighten

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.