Cycle graph

Common card · No. 362858

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 (at least 3, if the graph is simple) 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. Cycle graph C 1 {\displaystyle C_{1}} is an isolated loop. Cycle graph C 3 {\displaystyle C_{3}} is the same as complete graph K 3 {\displaystyle K_{3}} .

Read on Wikipedia · Image Public domain