Overview

walk


Show Summary Details

Quick Reference

(in graph theory)

The general name given to a sequence of edges and vertices in a graph. Walks with certain properties are of particular interest and are given specific names. So a walk in which no edge is repeated is a trail, and if no vertex is revisited in the course of a trail it is a path. The special case where the path finishes at the vertex where it started is an exception to this, and is termed a cycle or loop.

Subjects: Mathematics.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.