A closed path: v₀ = v_k with v₁, …, v_{k-1} distinct. A graph without cycles is a forest.
Cycle
Related concepts
- Graph G = (V, E)
- Path
- Tree (graph-theoretic)
- Hamilton cycle
- Su–Schrieffer–Heeger model (dimerised bipartite chain, condensed-matter)
- Bloch's theorem
- Time standards: TAI, UTC, TT
- n-ring σ-disconnection count = n; cyclohexane n=6 ⇒ 6
- Retrosynthetic analysis
- Biogeochemical cycle
- Heterogeneous catalytic cycles
- CNO bicycle framework: 4p → α + 2e⁺ + 2ν_e; CNO catalysts (C, N, O) conserved modulo cycle
- Chapman mechanism (stratospheric ozone)
- Photosystem II oxygen-evolving complex
- Biological carbon pump
- Parasite life cycle
- Hypothalamic-pituitary-gonadal axis
- β-oxidation cyclic decomposition framework
- Urea cycle (ornithine cycle) framework