Permutation groups, vertex-transitive digraphs and semiregular automorphisms (Q1272773)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Permutation groups, vertex-transitive digraphs and semiregular automorphisms |
scientific article; zbMATH DE number 1235001
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Permutation groups, vertex-transitive digraphs and semiregular automorphisms |
scientific article; zbMATH DE number 1235001 |
Statements
Permutation groups, vertex-transitive digraphs and semiregular automorphisms (English)
0 references
23 March 1999
0 references
A nonidentity element of a permutation group is said to be semiregular if in its disjoint cycle decomposition all cycles have the same length. The authors prove every cubic vertex-transitive graph has a semiregular automorphism. In addition, they prove every vertex-transitive digraph of order \(2p^2\), \(p\) a prime, has a semiregular automorphism.
0 references
semiregular automorphism
0 references
vertex-transitive
0 references
cubic graphs
0 references
