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.


The length of a walk 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.