We present a new approach to analysing finite graphs which admit a vertex intransitive group of automorphisms G and are either locally (G, s)-arc transitive for s > 2 or G-locally primitive. Such… Expand

This paper looks at codes in the Hamming Graphs and provides a structure theorem which shows that completely transitive codes are made up of either transitive or nearly complete, completely transitives codes.Expand

The paper determines all permutation groups with a transitive minimal normal subgroup that have no fixed point free elements of prime order. All such groups are primitive and are wreath products in a… Expand

A transitive finite permutation group is called elusive if it contains no nontrivial semiregular subgroup. The purpose of the paper is to collect known information about elusive groups. The main… Expand

An elusive permutation group is a transitive permutation group with no fixed point free elements of prime order, or equivalently, no nontrivial semiregular subgroups. We provide several new… Expand

The commuting graph of a group $G$ is the simple undirected graph whose vertices are the non-central elements of $G$ and two distinct vertices are adjacent if and only if they commute. It is… Expand