Pentavalent symmetric graphs of order 12\(p\) (Q665754)

Summary: A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In this paper, a complete classification of connected pentavalent symmetric graphs of order 12\(p\) is given for each prime \(p\). As a result, a connected pentavalent symmetric graph of order 12\(p\) exists if and only if \(p = 2, 3, 5\) or 11, and up to isomorphism, there are only nine such graphs: one for each \(p = 2, 3\) and 5, and six for \(p = 11\).