Classification of cubic symmetric tetracirculants and pentacirculants

A graph is said to be symmetric if its automorphism group acts transitively on the set of its arcs. All cubic symmetric circulants, bicirculants and tricirculants are known, and in this paper we give complete classifications of cubic symmetric tetracirculants and pentacirculants. In particular, it is shown that there are infinitely many connected cubic symmetric tetracirculants whereas there are only two connected cubic symmetric pentacirculants.