Classification of cubic vertex-transitive tricirculants
DOI:
https://doi.org/10.26493/1855-3974.1815.b52Keywords:
Graph, cubic, semiregular automorphism, tricirculant, vertex-transitiveAbstract
A finite graph is called a tricirculant if admits a cyclic group of automorphism which has precisely three orbits on the vertex-set of the graph, all of equal size. We classify all finite connected cubic vertex-transitive tricirculants. We show that except for some small exceptions of order less than 54, each of these graphs is either a prism of order 6k with k odd, a Möbius ladder, or it falls into one of two infinite families, each family containing one graph for every order of the form 6k with k odd.
Downloads
Published
2020-05-29
Issue
Section
Articles
License
Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/