Cycle Graph is Connected

Theorem

Let $G = \struct {V, E}$ be a cycle graph.

Then $G$ is connected.

Proof

A cycle graph is defined as a (simple) graph which consists of a single cycle.

So a cycle graph consists of just one component, and hence is connected.

$\blacksquare$