English

On $n$-partite digraphical representations of finite groups

Combinatorics 2021-08-02 v1 Group Theory

Abstract

A group GG admits an \textbf{\em nn-partite digraphical representation} if there exists a regular nn-partite digraph Γ\Gamma such that the automorphism group Aut(Γ)\mathrm{Aut}(\Gamma) of Γ\Gamma satisfies the following properties: Aut(Γ)\mathrm{Aut}(\Gamma) is isomorphic to GG, Aut(Γ)\mathrm{Aut}(\Gamma) acts semiregularly on the vertices of Γ\Gamma and the orbits of Aut(Γ)\mathrm{Aut}(\Gamma) on the vertex set of Γ\Gamma form a partition into nn parts giving a structure of nn-partite digraph to Γ\Gamma. In this paper, for every positive integer nn, we classify the finite groups admitting an nn-partite digraphical representation.

Keywords

Cite

@article{arxiv.2107.14279,
  title  = {On $n$-partite digraphical representations of finite groups},
  author = {Jia-Li Du and Yan-Quan Feng and Pablo Spiga},
  journal= {arXiv preprint arXiv:2107.14279},
  year   = {2021}
}

Comments

9 pages

R2 v1 2026-06-24T04:40:00.373Z