On automorphisms of strongly regular graphs with parameters λ = 1, μ = 2
Alexander A. Makhnev, I. M. Minakova · Discrete Mathematics and Applications · 2004
Let Γ be a strongly regular graph with parameters ( v , k , 1, 2). Then k = u 2 + 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.