Graphical Cyclic Permutation Groups

2012/10/25 by Mariusz Grech, Grech, Mariusz
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems #math.CO

paper · pdf · doi:10.48550/arxiv.1210.6804

arxiv created 2012/10/25 · openalex publication_date 2012/10/25 · arxiv updated 2012/10/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• An elementary proof of a conjecture on graph-automorphism
• Abelian permutation groups with graphical representations
• Decompositions of the authomorphism groups of edge-colored graphs into the direct product of permutation groups
• Automorphism groups of graphs
• Graphs, permutations and topological groups