This is a substantial revision of a much-quoted monograph, first published in 1974. The
structure is unchanged, but the text has been clarified and the notation brought into line with …

Collecting results scattered throughout the literature into one source, An Introduction to
Quasigroups and Their Representations shows how representation theories for groups are …

A 2-arc in a graph Γ is a sequence (α, β, γ) of three vertices of Γ such that {α, β} and {β, γ} are
edges of Γ and α≠ γ. A graph Γ is said to be 2-arc transitive if its automorphism group is …

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\geq 2$ or …

An approach to analysing the family of Cayley graphs for a finite group G is given which
identifies normal edge-transitive Cayley graphs as a sub-family of central importance. These …

Permutation groups, their fundamental theory and applications are discussed in this
introductory book. It focuses on those groups that are most useful for studying symmetric …

The theory of vertex-transitive graphs has developed in parallel with the theory of transitive
permutation groups. The chapter explores the way the two theories have influenced each …

Let Γ be a finite 2-arc-transitive Cayley graph of an abelian group. It is shown that either Γ is
explicitly known, or Γ may be represented as a normal or bi-normal Cayley graph of an …

This paper forms part of a program for classifying fi~ lite quasiprimitive 2-arc transitive
graphs. In [9] it xas shown that every non-bipartite 2-arc transitive graph is a cover of a …

The harmonious chromatic number of a graph is the least number of colours in a vertex
colouring such that each pair of colours appears on at most one edge. The achromatic …