Definition:Walk (Graph Theory)/Closed
< Definition:Walk (Graph Theory)(Redirected from Definition:Closed Walk)
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:
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
- 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): walk
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): walk
- 2014: Christopher Clapham and James Nicholson: The Concise Oxford Dictionary of Mathematics (5th ed.) ... (previous) ... (next): closed (in graph theory)