Valency seven symmetric graphs of order
A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In this paper, all connected valency seven symmetric graphs of order are classified, where , are distinct primes. It follows from the classification that there is a unique connected valency seven symmetric graph of order , and that for odd primes and , there is an infinite family of connected valency seven one-regular graphs of order with solvable automorphism groups, and there are four sporadic ones...