On n-partite digraphical representations of finite groups
Abstract
A group G admits an n-partite digraphical representation if there exists a regular n-partite digraph such that the automorphism group Aut() of satisfies the following properties: Aut() is isomorphic to G, Aut() acts semiregularly on the vertices of and the orbits of Aut() on the vertex set of form a partition into n parts giving a structure of n-partite digraph to . In this paper, for every positive integer n, we classify the finite groups admitting an n-partite digraphical representation.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.