Definition:Cycle (Graph Theory)

From ProofWiki
(Redirected from Definition:Closed Path)
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.


Subgraph

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 defined as

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

Some sources specify that a cycle must indeed have at least $3$ edges, presupposing that the graph in which it is embedded is by definition a simple graph.


Also known as

Some sources refer to a cycle as a closed path.


Also see


Sources