Cubic edge-transitive graphs of order 4 p 2
Acta mathematica Universitatis Comenianae, Tome 78 (2009) no. 2
Citer cet article
Voir la notice de l'article provenant de la source Comenius University
A regular graph G is said to be semisymmetric if its full automorphism group acts transitively on its edge-set but not on its vertex-set. It was shown by Folkman [5] that a regular edge-transitive graph of order 2 p or 2 p 2 is necessarily vertex-transitive, where p is a prime. In this paper, it is proved that there is no connected semisymmetric cubic graph of order 4 p 2 , where p is a prime.