A nonidentity element of a permutation group is said to be semiregular if all of its orbits have the same length. The work in this paper is linked to 6 where the problem of existence of semiregular automorphisms in vertex-transitive digraphs was posed. It was observed there that every vertex-transitive digraph of orderpkormp, wherepis a prime,k?1 andm?pare positive integers, has a semiregular automorphism. On the other hand, there are transitive permutation groups without semiregular elements 4. In this paper, it is proved that every cubic vertex-transitive graph contains a semiregular automorphism, and moreover, it is shown that every vertex-transitive digraph of order 2p2, wherepis a prime, contains a semiregular automorphism.
[1]
Dragan Marusic,et al.
On vertex symmetric digraphs
,
1981,
Discret. Math..
[2]
M. Schacher,et al.
Relative Brauer groups II.
,
1981
.
[3]
D. Robinson.
A Course in the Theory of Groups
,
1982
.
[4]
Elwood S. Buffa,et al.
Graph Theory with Applications
,
1977
.
[5]
Dragan Marui.
On vertex symmetric digraphs
,
1981
.
[6]
Brian Alspach,et al.
Lifting Hamilton cycles of quotient graphs
,
1989,
Discret. Math..
[7]
Arthur T. White,et al.
Permutation Groups and Combinatorial Structures
,
1979
.