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

Coolsaet, K., Degraer, J. and Spence, E. (2006) The strongly regular (45,12,3,3) graphs. Electronic Journal of Combinatorics, 13(1), R32.

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.

• Item Type: Articles
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Spence, Dr Edward
• Authors: Coolsaet, K., Degraer, J., and Spence, E.
• Subjects: Q Science > QA Mathematics
• College/School: College of Science and Engineering > School of Mathematics and Statistics > Mathematics
• Journal Name: Electronic Journal of Combinatorics
• Journal Abbr.: Electron. j. comb.
• Publisher: American Mathematical Society
• ISSN: 1097-1440
• ISSN (Online): 1077-8926
• Published Online: 04 April 2006
• Copyright Holders: Copyright © 2006 American Mathematical Society
• First Published: First published in Electronic Journal Of Combinatorics 13(1):R32
• Publisher Policy: Reproduced in accordance with the copyright policy of the publisher