Supergaphs and Graphical Complexity of Permutation Groups

Abstract

This paper introduces the concepts of a \({supergraph}\) and \({graphical\; complexity}\) of a permutation group, intended as a tool for investigating the structure of concrete permutation groups. Basic results are established and some research problems suggested.