| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653440 | European Journal of Combinatorics | 2015 | 9 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Michael Giudici, Luke Morgan, Primož Potočnik, Gabriel Verret,