Classification of cubic symmetric tricirculants
The electronic journal of combinatorics, Tome 19 (2012) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/2371
Classification : 05C60
Mots-clés : symmetric graph, semiregular, tricirculant

Istvan Kovacs  1   ; Klavdija Kutnar  1   ; Dragan Marusic  1   ; Steve Wilson  2

1 University of Primorska
2 Northern Arizona University
@article{10_37236_2371,
     author = {Istvan Kovacs and Klavdija Kutnar and Dragan Marusic and Steve Wilson},
     title = {Classification of cubic symmetric tricirculants},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {2},
     doi = {10.37236/2371},
     zbl = {1244.05152},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2371/}
}
TY  - JOUR
AU  - Istvan Kovacs
AU  - Klavdija Kutnar
AU  - Dragan Marusic
AU  - Steve Wilson
TI  - Classification of cubic symmetric tricirculants
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2371/
DO  - 10.37236/2371
ID  - 10_37236_2371
ER  - 
%0 Journal Article
%A Istvan Kovacs
%A Klavdija Kutnar
%A Dragan Marusic
%A Steve Wilson
%T Classification of cubic symmetric tricirculants
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/2371/
%R 10.37236/2371
%F 10_37236_2371
Istvan Kovacs; Klavdija Kutnar; Dragan Marusic; Steve Wilson. Classification of cubic symmetric tricirculants. The electronic journal of combinatorics, Tome 19 (2012) no. 2. doi: 10.37236/2371

Cité par Sources :