Cycle graph (algebra)
In group theory, a subfield of abstract algebra, a group cycle graph illustrates the various cycles of a group and is particularly useful in visualizing the structure of small finite groups.
A cycle is the set of powers of a given group element a, where a^{n}, the nth power of an element a is defined as the product of a multiplied by itself n times. The element a is said to generate the cycle. In a finite group, some nonzero power of a must be the group identity, e; the lowest such power is the order of the cycle, the number of distinct elements in it. In a cycle graph, the cycle is represented as a polygon, with the vertices representing the group elements, and the connecting lines indicating that all elements in that polygon are members of the same cycle.
Cycles
Cycles can overlap, or they can have no element in common but the identity. The cycle graph displays each interesting cycle as a polygon.
If a generates a cycle of order 6 (or, more shortly, has order 6), then a^{6} = e. Then the set of powers of a^{2}, {a^{2}, a^{4}, e} is a cycle, but this is really no new information. Similarly, a^{5} generates the same cycle as a itself.
So, only the primitive cycles need be considered, namely those that are not subsets of another cycle. Each of these is generated by some primitive element, a. Take one point for each element of the original group. For each primitive element, connect e to a, a to a^{2}, ..., a^{n−1} to a^{n}, etc., until e is reached. The result is the cycle graph.
When a^{2} = e, a has order 2 (is an involution), and is connected to e by two edges. Except when the intent is to emphasize the two edges of the cycle, it is typically drawn[1] as a single line between the two elements.
Properties
Dih_{4} kaleidoscope with red mirror and 4fold rotational generators 
Cycle graph for dihedral group Dih_{4}. 
As an example of a group cycle graph, consider the dihedral group Dih_{4}. The multiplication table for this group is shown on the left, and the cycle graph is shown on the right with e specifying the identity element.
^{o}  e  b  a  a^{2}  a^{3}  ab  a^{2}b  a^{3}b 

e  e  b  a  a^{2}  a^{3}  ab  a^{2}b  a^{3}b 
b  b  e  a^{3}b  a^{2}b  ab  a^{3}  a^{2}  a 
a  a  ab  a^{2}  a^{3}  e  a^{2}b  a^{3}b  b 
a^{2}  a^{2}  a^{2}b  a^{3}  e  a  a^{3}b  b  ab 
a^{3}  a^{3}  a^{3}b  e  a  a^{2}  b  ab  a^{2}b 
ab  ab  a  b  a^{3}b  a^{2}b  e  a^{3}  a^{2} 
a^{2}b  a^{2}b  a^{2}  ab  b  a^{3}b  a  e  a^{3} 
a^{3}b  a^{3}b  a^{3}  a^{2}b  ab  b  a^{2}  a  e 
Notice the cycle {e, a, a^{2}, a^{3}} in the multiplication table, with a^{4} = e. The inverse a^{−1} = a^{3} is also a generator of this cycle: (a^{3})^{2} = a^{2}, (a^{3})^{3} = a, and (a^{3})^{4} = e. Similarly, any cycle in any group has at least two generators, and may be traversed in either direction. More generally, the number of generators of a cycle with n elements is given by the Euler φ function of n, and any of these generators may be written as the first node in the cycle (next to the identity e); or more commonly the nodes are left unmarked. Two distinct cycles cannot intersect in a generator.
Cycles that contain a nonprime number of elements have cyclic subgroups that are not shown in the graph. For the group Dih_{4} above, we could draw a line between a^{2} and e since (a^{2})^{2} = e, but since a^{2} is part of a larger cycle, this is not an edge of the cycle graph.
There can be ambiguity when two cycles share a nonidentity element. For example, the 8element quaternion group has cycle graph shown at right. Each of the elements in the middle row when multiplied by itself gives −1 (where 1 is the identity element). In this case we may use different colors to keep track of the cycles, although symmetry considerations will work as well.
As noted earlier, the two edges of a 2element cycle are typically represented as a single line.
The inverse of an element is the node symmetric to it in its cycle, with respect to the reflection which fixes the identity.
History
Cycle graphs were investigated by the number theorist Daniel Shanks in the early 1950s as a tool to study multiplicative groups of residue classes.[2] Shanks first published the idea in the 1962 first edition of his book Solved and Unsolved Problems in Number Theory.[3] In the book, Shanks investigates which groups have isomorphic cycle graphs and when a cycle graph is planar.[4] In the 1978 second edition, Shanks reflects on his research on class groups and the development of the babystep giantstep method:[5]
The cycle graphs have proved to be useful when working with finite Abelian groups; and I have used them frequently in finding my way around an intricate structure [77, p. 852], in obtaining a wanted multiplicative relation [78, p. 426], or in isolating some wanted subgroup [79].
Cycle graphs are used as a pedagogical tool in Nathan Carter's 2009 introductory textbook Visual Group Theory.[6]
Graph characteristics of particular group families
Certain group types give typical graphs:
Cyclic groups Z_{n}, order n, is a single cycle graphed simply as an nsided polygon with the elements at the vertices:
Z_{1}  Z_{2} = Dih_{1}  Z_{3}  Z_{4}  Z_{5}  Z_{6}=Z_{3}×Z_{2}  Z_{7}  Z_{8} 

Z_{9}  Z_{10}=Z_{5}×Z_{2}  Z_{11}  Z_{12}=Z_{4}×Z_{3}  Z_{13}  Z_{14}=Z_{7}×Z_{2}  Z_{15}=Z_{5}×Z_{3}  Z_{16} 
Z_{17}  Z_{18}=Z_{9}×Z_{2}  Z_{19}  Z_{20}=Z_{5}×Z_{4}  Z_{21}=Z_{7}×Z_{3}  Z_{22}=Z_{11}×Z_{2}  Z_{23}  Z_{24}=Z_{8}×Z_{3} 
Z_{2}  Z_{2}^{2} = Dih_{2}  Z_{2}^{3} = Dih_{2}×Dih_{1}  Z_{2}^{4} = Dih_{2}^{2} 

When n is a prime number, groups of the form (Z_{n})^{m} will have (n^{m} − 1)/(n − 1) nelement cycles sharing the identity element:
Z_{2}^{2} = Dih_{2}  Z_{2}^{3} = Dih_{2}×Dih_{1}  Z_{2}^{4} = Dih_{2}^{2}  Z_{3}^{2} 

Dihedral groups Dih_{n}, order 2n consists of an nelement cycle and n 2element cycles:
Dih_{1} = Z_{2}  Dih_{2} = Z_{2}^{2}  Dih_{3}  Dih_{4}  Dih_{5}  Dih_{6}=Dih_{3}×Z_{2}  Dih_{7}  Dih_{8}  Dih_{9}  Dih_{10}=Dih_{5}×Z_{2} 

Dicyclic groups, Dic_{n} = Q_{4n}, order 4n:
Dic_{2} = Q_{8}  Dic_{3} = Q_{12}  Dic_{4} = Q_{16}  Dic_{5} = Q_{20}  Dic_{6} = Q_{24} 

Other direct products:
Z_{4}×Z_{2}  Z_{4}×Z_{2}^{2}  Z_{6}×Z_{2}  Z_{8}×Z_{2}  Z_{4}^{2} 

Symmetric groups – The symmetric group S_{n} contains, for any group of order n, a subgroup isomorphic to that group. Thus the cycle graph of every group of order n will be found in the cycle graph of S_{n}.
See example: Subgroups of S_{4}
Example: Subgroups of the full octahedral group
The full octahedral group is the cross product of the symmetric group S_{4} and the cyclic group Z_{2}.
Its order is 48, and it has subgroups of every order that divides 48.
In the examples below nodes that are related to each other are placed next to each other,
so these are not the simplest possible cycle graphs for these groups (like those on the right).
S_{4} × Z_{2} (order 48)  A_{4} × Z_{2} (order 24)  Dih_{4} × Z_{2} (order 16)  S_{3} × Z_{2} = Dih_{6} (order 12) 

S_{4} (order 24)  A_{4} (order 12)  Dih_{4} (order 8)  S_{3} = Dih_{3} (order 6) 
Like all graphs a cycle graph can be represented in different ways to emphasize different properties. The two representations of the cycle graph of S_{4} are an example of that.


See also
Wikimedia Commons has media related to Group cycle graphs. 
External links
References
 Sarah Perkins (2000). "Commuting Involution Graphs for A˜n, Section 2.2, p.3, first figure" (PDF). Birkbeck College, Malet Street, London, WC1E 7HX: School of Economics, Mathematics and Statistics. Retrieved 20160131.
 Shanks 1978, p. 246.
 Shanks 1978, p. xii.
 Shanks 1978, pp. 83–98, 206–208.
 Shanks 1978, p. 225.
 Carter, Nathan (2009), Visual Group Theory, Classroom Resource Materials, Mathematical Association of America, ISBN 9780883857571
 Skiena, S. (1990). Cycles, Stars, and Wheels. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica (pp. 144147).
 Shanks, Daniel (1978) [1962], Solved and Unsolved Problems in Number Theory (2nd ed.), New York: Chelsea Publishing Company, ISBN 0828402973
 Pemmaraju, S., & Skiena, S. (2003). Cycles, Stars, and Wheels. Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica (pp. 248249). Cambridge University Press.