Abelian permutation groups with graphical representations
Combinatorics
2019-10-28 v1
Abstract
In this paper we characterize permutation groups that are automorphism groups of coloured graphs and digraphs and are abelian as abstract groups. This is done in terms of basic permutation group properties. Using Schur's classical terminology, what we provide is characterizations of the classes of 2-closed and -closed abelian permutation groups. This is the first characterization concerning these classes since they were defined.
Cite
@article{arxiv.1910.11816,
title = {Abelian permutation groups with graphical representations},
author = {Mariusz Grech and Andrzej Kisielewicz},
journal= {arXiv preprint arXiv:1910.11816},
year = {2019}
}