Definition:Walk (Graph Theory)/Closed

From ProofWiki
Jump to navigation Jump to search

Definition

A closed walk is a walk whose first vertex is the same as the last.

That is, it is a walk which ends where it starts.


Examples

Arbitrary Example

In the multigraph below:

Graph-3.png

the walk $P, f, Q, b, R, b, Q, f, P$ is a closed walk.


Also see

  • Results about closed walks can be found here.


Sources