Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4653642 | European Journal of Combinatorics | 2013 | 26 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Boštjan Frelih, Klavdija Kutnar,