Cycle graph

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 C_n. The number of vertices in C_n equals the number of edges, and every vertex has degree 2; that is, every vertex has exactly two edges incident with it.

In graph theory, there are several different types of object called cycles, principally a closed walk and a simple cycle; also, e.g., an element of the cycle space of the graph.