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:(1)Aut(Γ) is isomorphic to G,(2)Aut(Γ) acts semiregularly on the vertices of Γ and(3)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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call