Home On automorphisms of strongly regular graphs with parameters λ = 1, μ = 2
Article
Licensed
Unlicensed Requires Authentication

On automorphisms of strongly regular graphs with parameters λ = 1, μ = 2

  • A. A. Makhnev and I. M. Minakova
Published/Copyright: June 1, 2004
Become an author with De Gruyter Brill
Discrete Mathematics and Applications
From the journal Volume 14 Issue 2

Let Γ be a strongly regular graph with parameters (v, k, 1, 2). Then k = u2 + u + 2 and u = 1, 3, 4, 10, or 31. It is known that such graphs exist for u equal to 1 and 4. They are the (3 × 3)-lattice and the graph of cosets of the ternary Golay code. If u = 3, then Γ has the parameters (99, 14, 1, 2). The question on existence of such graphs was posed by J. Seidel.

With the use of theory of characters of finite groups we find the possible orders and the structures of subgraphs of the fixed points of automorphisms of the graph Γ with parameters (99, 14, 1, 2). It is proved that if the group Aut(Γ) contains an involution, then its order divides 42.

Published Online: 2004-06-01
Published in Print: 2004-06-01

Copyright 2004, Walter de Gruyter

Downloaded on 2.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/156939204872374/html
Scroll to top button