Walks, Paths and Cycles

Abstract

A walk in a graph G is a finite sequence of vertices x ₀,x ₁,...,x _n and edges a ₁, a ₂,...,a _n of G:

$$ x_0 ,a_1 ,x_1 ,a_2 , \ldots ,a_n ,x_n , $$

Where the endpoints of a _i are x _i-1 and x _i for each _i. A simple walk is a walk in which no edge is repeated. If it is desired to specify the terminal vertices, the above walk is called an x ₀ x _n -walk. The length of a walk is its number of edges.