Cycle graph (algebra)

In graph theory, a cycle graph, often denoted as \( C_n \), is a specific type of graph that consists of a single cycle. It has the following characteristics: 1. **Vertex Count**: A cycle graph \( C_n \) has \( n \) vertices, where \( n \) is a positive integer \( n \geq 3 \). If \( n < 3 \), it does not form a proper cycle.