Discrete Mathsfor Engineers

Structures, proofs, and intuition
EN | PT

Graph Theory → Foundations

Part 9 of 11 — Cycle

Series: Foundations Part 9 of 11
← Previous Next →
1 2 3 4 5 6 7 8 9 10 11

Cycle

A cycle is a closed walk in which no vertex is repeated, except for the initial vertex, which coincides with the final vertex. In particular, a cycle does not repeat edges.

› Cycles: - ⟨A, D, E, C, A⟩ - ⟨A, B, C, A⟩ - ⟨A, B, E, C, A⟩ - ⟨D, E, C, D⟩ - ⟨D, E, C, A, D⟩ - ⟨A, A⟩ o q r t u p w y i A B C D E
Example of a directed graph with listed cycles. Note that ⟨A, A⟩ is a cycle when there is a loop at A.
Made with ❤️ by Leandro Rodrigues