Graph Cycle

A special type of Graph Path that results in the final node being the first node. By convention, a cycle must contain atleast 3 different nodes

Cycle Length

$\{b,c,a,b\}$ : length 3

Simple Cycle

A cycle wherein:

• Consecutive vertices are adjacent
• First vertex is last vertex
• Verticies are distinct except first and last which are the same (no repeats)
• $⟨v⟩$ is not a cycle