Elsevier

Discrete Mathematics

Volume 311, Issue 20, 28 October 2011, Pages 2259-2267
Discrete Mathematics

Pentavalent symmetric graphs of order 2pq

https://doi.org/10.1016/j.disc.2011.07.007Get rights and content
Under an Elsevier user license
open archive

Abstract

A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In this paper, all connected pentavalent symmetric graphs of order 2pq are classified, where p,q are distinct primes. It follows from the classification that there are two connected pentavalent symmetric graphs of order 4p, and that for odd primes p and q, there is an infinite family of connected pentavalent symmetric graphs of order 2pq with solvable automorphism groups and there are seven sporadic ones with nonsolvable automorphism groups.

Keywords

Arc-transitive graph
Symmetric graph
s-regular graph

Cited by (0)