[HTML][HTML] Elusive groups of automorphisms of digraphs of small valency
European Journal of Combinatorics, 2015•Elsevier
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.
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.
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.
Elsevier
以上显示的是最相近的搜索结果。 查看全部搜索结果