Semiregular automorphisms of arc-transitive graphs with valency \(pq\) (Q2426438)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Semiregular automorphisms of arc-transitive graphs with valency \(pq\) |
scientific article |
Statements
Semiregular automorphisms of arc-transitive graphs with valency \(pq\) (English)
0 references
22 April 2008
0 references
A semiregular automorphism of a graph is a nonidentity automorphism all orbits of which are of equal length. Marušič has conjectured that every vertex-transitive digraph has a semiregular automorphism [\textit{D. Marušič}, Discrete Math. 36, 69--81 (1981; Zbl 0459.05041)]. This conjecture remains open despite several partial results. In this paper it is shown that if a graph is arc-transitive, has valency \(pq\) (\(p,q\) not necessarily distinct primes) and its automorphism group has a nonabelian minimal normal subgroup with at least three orbits on the vertex set, then it does have a semiregular automorphism. The proof uses properties of elusive permutation groups which are transitive permutation groups containing no fixed point free elements of prime order.
0 references
vertex-transitive graphs
0 references
semiregular automorphisms
0 references
elusive permutation groups
0 references