Definition:Walk (Graph Theory)/Length

From ProofWiki
Jump to navigation Jump to search

This page is about length of a walk in the context of Graph Theory. For other uses, see Length.

Definition

The length of a walk (or a path, or a trail) is the number of edges it has, counting repeated edges as many times as they appear.


A walk is said to be of infinite length if and only if it has infinitely many edges.


Zero Length Walk

A zero length walk is a walk which consists of one vertex.


Examples

Arbitrary Example

In the graph below:

Graph-2.png

the path $1, 3, 4$ has length $2$.

The vertex $5$ forms a zero length walk.


Sources