In group theory, a subfield of abstract algebra, a cycle graph of a group is an undirected graph that illustrates the various cycles of that group, given a set of generators for the group. Cycle graphs are particularly useful in visualizing the structure of small finite groups.
A cycle is the set of powers of a given group element a, where an, the n-th 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 non-zero power of a must be the group identity, which we denote either as e or 1; the lowest such power is the order of the element a, the number of distinct elements in the cycle that it generates. In a cycle graph, the cycle is represented as a polygon, with its vertices representing the group elements and its edges indicating how they are linked together to form the cycle.
Each group element is represented by a node in the cycle graph, and enough cycles are represented as polygons in the graph so that every node lies on at least one cycle. All of those polygons pass through the node representing the identity, and some other nodes may also lie on more than one cycle.
Suppose that a group element a generates a cycle of order 6 (has order 6), so that the nodes a, a2, a3, a4, a5, and a6 = e are the vertices of a hexagon in the cycle graph. The element a2 then has order 3; but making the nodes a2, a4, and e be the vertices of a triangle in the graph would add no new information. So, only the primitive cycles need be considered, those that are not subsets of another cycle. Also, the node a5, which also has order 6, generates the same cycle as does a itself; so we have at least two choices for which element to use in generating a cycle --- often more.
To build a cycle graph for a group, we start with a node for each group element. For each primitive cycle, we then choose some element a that generates that cycle, and we connect the node for e to the one for a, a to a2, ..., ak−1 to ak, etc., until returning to e. The result is a cycle graph for the group.
When a group element a has order 2 (so that multiplication by a is an involution), the rule above would connect e to a by two edges, one going out and the other coming back. Except when the intent is to emphasize the two edges of such a cycle, it is typically drawn[1] as a single line between the two elements.
Note that this correspondence between groups and graphs is not one-to-one in either direction: Two different groups can have the same cycle graph, and two different graphs can be cycle graphs for a single group. We give examples of each in the non-uniqueness section.
As an example of a group cycle graph, consider the dihedral group Dih4. 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 | a2 | a3 | ab | a2b | a3b | |
|---|---|---|---|---|---|---|---|---|---|
| e | e | b | a | a2 | a3 | ab | a2b | a3b | |
| b | b | e | a3b | a2b | ab | a3 | a2 | a | |
| a | a | ab | a2 | a3 | e | a2b | a3b | b | |
| a2 | a2 | a2b | a3 | e | a | a3b | b | ab | |
| a3 | a3 | a3b | e | a | a2 | b | ab | a2b | |
| ab | ab | a | b | a3b | a2b | e | a3 | a2 | |
| a2b | a2b | a2 | ab | b | a3b | a | e | a3 | |
| a3b | a3b | a3 | a2b | ab | b | a2 | a | e |
Notice the cycle in the multiplication table, with a4 = e. The inverse a−1 = a3 is also a generator of this cycle: (and . 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 non-prime number of elements have cyclic subgroups that are not shown in the graph. For the group Dih4 above, we could draw a line between a2 and e since, but since a2 is part of a larger cycle, this is not an edge of the cycle graph.
There can be ambiguity when two cycles share a non-identity element. For example, the 8-element 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 2-element 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.
The cycle graph of a group is not uniquely determined up to graph isomorphism; nor does it uniquely determine the group up to group isomorphism. That is, the graph obtained depends on the set of generators chosen, and two different groups (with chosen sets of generators) can generate the same cycle graph.[2]
For some groups, choosing different elements to generate the various primitive cycles of that group can lead to different cycle graphs. There is an example of this for the abelian group
C5 x C2 x C2
(i;j,k)
0\lei<5
j
k
(0;0,0)
i
j
k
This group has three primitive cycles, each of order 10. In the first cycle graph, we choose, as the generators of those three cycles, the nodes
(1;1,0)
(1;0,1)
(1;1,1)
(2;1,1)
Two different (non-isomorphic) groups can have cycle graphs that are isomorphic, where the latter isomorphism ignores the labels on the nodes of the graphs. It follows that the structure of a group is not uniquely determined by its cycle graph.
There is an example of this already for groups of order 16, the two groups being
C8 x C2
C8\rtimes5C2
C8 x C2
C8\rtimes5C2
C8
C2
C2
C8
In drawing the cycle graphs of those two groups, we take
C8 x C2
s8=t2=1 and ts=st,
C8 x C2
C8\rtimes5C2
\sigma8=\tau2=1 and \tau\sigma=\sigma5\tau.
Here are cycle graphs for those two groups, where we choose
st
\sigma\tau
\sigma\tau
\sigma6,
(\sigma\tau)(\sigma\tau)=\sigma(\tau\sigma)\tau=\sigma(\sigma5\tau)\tau=\sigma6.
Cycle graphs were investigated by the number theorist Daniel Shanks in the early 1950s as a tool to study multiplicative groups of residue classes. Shanks first published the idea in the 1962 first edition of his book Solved and Unsolved Problems in Number Theory. In the book, Shanks investigates which groups have isomorphic cycle graphs and when a cycle graph is planar. In the 1978 second edition, Shanks reflects on his research on class groups and the development of the baby-step giant-step method:
Cycle graphs are used as a pedagogical tool in Nathan Carter's 2009 introductory textbook Visual Group Theory.
Certain group types give typical graphs:
Cyclic groups Zn, order n, is a single cycle graphed simply as an n-sided polygon with the elements at the vertices:
When n is a prime number, groups of the form (Zn)m will have n-element cycles sharing the identity element:
Dihedral groups Dihn, order 2n consists of an n-element cycle and n 2-element cycles:
Dicyclic groups, Dicn = Q4n, order 4n:
Other direct products:
Symmetric groups – The symmetric group Sn 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 Sn.
See example: Subgroups of S4
S4 x Z2
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).
Like all graphs a cycle graph can be represented in different ways to emphasize different properties. The two representations of the cycle graph of S4 are an example of that.