A simple undirected graph \(G(V,E)\) with \(|V|=n\) vertices is called a cycle graph, if it consists of a single cycle of vertices and edges.
The cycle graph with \(n\) vertices is denoted by \(C_n\).
(c) bookofproofs
Thank you to the contributors under CC BY-SA 4.0!