Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ejc.2014.11.004 | European Journal of Combinatorics |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Valency,Automorphism,Permutation group,Connectivity,Mathematics,Transitive relation | Journal | 46 |
ISSN | Citations | PageRank |
0195-6698 | 1 | 0.41 |
References | Authors | |
5 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Giudici | 1 | 1 | 0.41 |
| Luke Morgan | 2 | 2 | 2.13 |
| P. PotočNik | 3 | 5 | 1.07 |
| Gabriel Verret | 4 | 2 | 2.17 |