Graphical cyclic permutation groups
Copyright policy )Graphical cyclic permutation groups
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.
- Institute of Mathematics Poland
- Polish Academy of Sciences Poland
- University of Wrocław Poland
graphs, permutation group, cyclic group, Finite automorphism groups of algebraic, geometric, or combinatorial structures, FOS: Mathematics, automorphism group, Mathematics - Combinatorics, Combinatorics (math.CO), Graphs and abstract algebra (groups, rings, fields, etc.)
graphs, permutation group, cyclic group, Finite automorphism groups of algebraic, geometric, or combinatorial structures, FOS: Mathematics, automorphism group, Mathematics - Combinatorics, Combinatorics (math.CO), Graphs and abstract algebra (groups, rings, fields, etc.)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).7 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!