# Definition:Cycle (Graph Theory)

Jump to navigation
Jump to search

## Definition

A **cycle** is a circuit in which no vertex except the first (which is also the last) appears more than once.

An **$n$-cycle** is a cycle with $n$ vertices.

The set of vertices and edges which go to make up a cycle form a subgraph.

This subgraph itself is also referred to as a **cycle**.

### Odd Cycle

An **odd cycle** is a cycle with odd length, that is, with an odd number of edges.

### Even Cycle

An **even cycle** is a cycle with even length, that is, with an even number of edges.

## Also known as

Some sources refer to a **cycle** as a **closed path**.

Some sources specify a **cycle** as having at least one edge.

## Sources

- 1977: Gary Chartrand:
*Introductory Graph Theory*... (previous) ... (next): $\S 2.3$: Connected Graphs - 1998: David Nelson:
*The Penguin Dictionary of Mathematics*(2nd ed.) ... (previous) ... (next): Entry:**walk** - 2008: David Nelson:
*The Penguin Dictionary of Mathematics*(4th ed.) ... (previous) ... (next): Entry:**walk** - 2014: Christopher Clapham and James Nicholson:
*The Concise Oxford Dictionary of Mathematics*(5th ed.) ... (previous) ... (next): Entry:**closed**(in graph theory) - 2014: Christopher Clapham and James Nicholson:
*The Concise Oxford Dictionary of Mathematics*(5th ed.) ... (previous) ... (next): Entry:**cycle**(in graph theory)