Size of Cycle Graph equals Order

Theorem

The size of a cycle graph equals its order.

Proof

Follows immediately from:

The fact that a cycle graph is $2$-regular

The result Number of Edges of Regular Graph which says that an $r$-regular graph with $n$ vertices has $\dfrac {n r} 2$ edges.

$\blacksquare$