Pentavalent symmetric graphs of order four times an odd square-free integer

Bo Ling, Ben Gong Lou, Ci Xuan Wu

Abstract


A graph is said to be symmetric if its automorphism group is transitive on its arcs. Guo et al. in 2011 and Pan et al. in 2013 determined all pentavalent symmetric graphs of order 4pq. In this paper, we shall generalize this result by determining all connected pentavalent symmetric graphs of order four times an odd square-free integer. It is shown in this paper that, for each such graph Γ, either the full automorphism group Aut Γ is isomorphic to PSL(2, p), PGL(2, p), PSL(2, p) × ℤ2 or PGL(2, p) × ℤ2, or Γ is isomorphic to one of 9 graphs.


Keywords


Arc-transitive graph, normal quotient, automorphism group

Full Text:

PDF


DOI: https://doi.org/10.26493/1855-3974.1333.68f

ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications