# Category:Definitions/Walks

This category contains definitions related to Walks in the context of Graph Theory.
Related results can be found in Category:Walks.

Let $G = \struct {V, E}$ be a graph.

A walk $W$ on $G$ is:

an alternating sequence of vertices $v_1, v_2, \ldots$ and edges $e_1, e_2, \ldots$ of $G$
beginning and ending with a vertex
in which edge $e_j$ of $W$ is incident with the vertex $v_j$ and the vertex $v_{j + 1}$.

A walk between two vertices $u$ and $v$ is called a $u$-$v$ walk.

## Subcategories

This category has only the following subcategory.

## Pages in category "Definitions/Walks"

The following 14 pages are in this category, out of 14 total.