Classification of Cubic Symmetric Tricirculants
István Kovács, Klavdija Kutnar, Dragan Marušič, Steve Wilson
Abstract
Open-access reader
István Kovács, Klavdija Kutnar, Dragan Marušič, Steve Wilson
Abstract
Open-access reader
A tricirculant is a graph admitting a non-identity automorphism having three cycles of equal length in its cycle decomposition. A graph is said to be symmetric if its automorphism group acts transitively on the set of its arcs. In this paper it is shown that the complete bipartite graph $K_{3,3}$, the Pappus graph, Tutte's 8-cage and the unique cubic symmetric graph of order 54 are the only connected cubic symmetric tricirculants.
OpenAlex reports 17 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A tricirculant is a graph admitting a non-identity automorphism having three cycles of equal length in its cycle decomposition. A graph is said to be symmetric if its automorphism group acts transitively on the set of its arcs. In this paper it is shown that the complete bipartite graph $K_{3,3}$, the Pappus graph, Tutte's 8-cage and the unique cubic symmetric graph of order 54 are the only connected cubic symmetric tricirculants.
Key concepts: Cubic graph, Mathematics, Combinatorics, Edge-transitive graph, Foster graph, Vertex-transitive graph, Graph automorphism, Symmetric graph