In
graph theory, a
cycle graph or
circular graph is a
graph that consists of a single
cycle, or in other words, some number of vertices connected in a closed chain. The cycle graph with
n vertices is called
Cn. The number of vertices in
Cn equals the number of
edges, and every vertex has
degree 2; that is, every vertex has exactly two edges incident with it.