Ontology Browser
›
graph-theory
› Cycle
Cycle
Layer 0 — Mathematics
in the
graph-theory
subtree
A closed path: v₀ = v_k with v₁, …, v_{k-1} distinct. A graph without cycles is a forest.
Related concepts
Graph G = (V, E)
Path
Tree (graph-theoretic)
Hamilton cycle
Su–Schrieffer–Heeger model (dimerised bipartite chain, condensed-matter)
Bloch's theorem
Explore Cycle on the interactive knowledge graph →