Graphical Cyclic Permutation Groups
Combinatorics
2012-10-26 v1
Abstract
We establish conditions for a permutation group generated by a single permutation of a prime power order to be an automorphism group of a graph or an edge-colored graph. This corrects and generalizes the results of the two papers on cyclic permutation groups published in 1978 and 1981 by S. P. Mohanty, M. R. Sridharan, and S. K. Shukla.
Cite
@article{arxiv.1210.6804,
title = {Graphical Cyclic Permutation Groups},
author = {Mariusz Grech},
journal= {arXiv preprint arXiv:1210.6804},
year = {2012}
}