Elusive groups of automorphisms of digraphs of small valency
classification
🧮 math.CO
math.GR
keywords
elusiveautomorphismsconnecteddigraphsgroupgroupsvalencycalled
read the original abstract
A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of connected digraphs of out-valency at most three.
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.