Characteristics of Cycle Graph

Theorem
Let $G = \struct {V, E}$ be an (undirected) graph whose order is greater than $2$.

Then $G$ is a cycle graph :
 * $G$ is connected
 * every vertex of $G$ is adjacent to $2$ other vertices
 * every edge of $G$ is adjacent to $2$ other edges.

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.

A cycle, at base, is a closed walk with the properties:


 * all its edges are distinct
 * all its vertices (except for the start and end) are distinct