Definition:Cycle Graph
Jump to navigation
Jump to search
This page has been identified as a candidate for refactoring. In particular:
Assemble these into appropriate pages
Definition
A cycle graph is a graph which consists of a single cycle.
The cycle graph of order $n$ is denoted $C_n$.
A cycle graph is $2$-regular.
Examples
Also see
Assemble these into appropriate pages
Until this has been finished, please leave {{refactor}} in the code.
New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only. Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$.
- From Characteristics of Eulerian Graph, it is clear that every cycle graph is Eulerian.
- It is also trivially clear that every cycle graph is Hamiltonian.
- $C_n$ is bipartite if and only if $n$ is even.
- $C_1$ is a loop-graph.
- $C_2$ is a multigraph.
- $C_3$ is the complete graph $K_3$.
- $C_4$ is the complete bipartite graph $K_{2, 2}$.
