Cycle Graph

A cycle of a Graph is a subset of the Edge-set of theGraph which forms a Chain (Graph), the first node of which is also the last. Thistype of cycle is also called a Circuit.

A cycle graph is a Graph which shows cycles of a Group as well as the connectivitybetween the cycles. Several examples are shown above. For Finite Group Z4, the group elements satisfy , where 1 is the Identity Element, and two elements satisfy .

For a Cyclic Group of Composite Order (e.g.,Finite Group Z4, Finite Group Z6, Finite Group Z8), the degeneratesubcycles corresponding to factors dividing are often not shown explicitly since their presence is implied.

Shanks, D. Solved and Unsolved Problems in Number Theory, 4th ed. New York: Chelsea, pp. 83-98, 1993.

• Cardioid Caustic
• Cardioid Evolute
• Cardioid Inverse Curve
• Cardioid Involute
• Cardioid Pedal Curve
• Cards
• Carleman's Inequality
• Carlson-Levin Constant
• Carlson's Theorem
• Carlyle Circle
• Carmichael Condition
• Carmichael Function
• Carmichael Number
• Carmichael's Conjecture
• Carmichael Sequence
• Carmichael's Theorem
• Carmichael's Totient Function Conjecture
• Carnot's Polygon Theorem
• Carnot's Theorem
• Carotid-Kundalini Fractal
• Carotid-Kundalini Function
• Carry
• Carrying Capacity
• Cartan Matrix
• Cartan Relation