Article
Licensed
Unlicensed Requires Authentication

On the automorphisms of the strongly regular graph with parameters (85, 14, 3, 2)

Published/Copyright: April 2, 2009
Become an author with De Gruyter Brill
Discrete Mathematics and Applications
From the journal Volume 19 Issue 1

Abstract

Let Γ be the strongly regular graph with parameters (85, 14, 3, 2), g be an element of prime order p of Aut(Γ) and Δ = Fix(g). In this paper, it is proved that either p = 5 or p = 17 and Δ is the empty graph, or p = 7 and Δ is a 1-clique, or p = 5 and Δ is a 5-clique, or p = 3 and Δ is a quadrangle or a 2 × 5 lattice, or p = 2 and Δ is a union of φ isolated vertices and ψ isolated triangles, ψ = 1 and φ ∈ {4, 6} or ψ = 0 and φ = 5. In addition, it is shown that the graph Γ is not vertex transitive.

Received: 2007-01-19
Published Online: 2009-04-02
Published in Print: 2009-March

© de Gruyter 2009

Downloaded on 12.4.2026 from https://www.degruyterbrill.com/document/doi/10.1515/DMA.2009.007/html
Scroll to top button