Semiregular automorphisms of edge-transitive graphs
classification
🧮 math.CO
math.GR
keywords
semiregularautomorphismedge-transitiveautomorphismsgraphsassertsconjecturecycles
read the original abstract
The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism, that is, a nontrivial automorphism whose cycles all have the same length. In this paper we investigate the existence of semiregular automorphisms of edge-transitive graphs. In particular, we show that any regular edge-transitive graph of valency three or four has a semiregular automorphism.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.