# simple path

A simple path in a graph is a path $P=v_{0}e_{0}v_{1}\dots e_{n-1}v_{n}$ such that no vertex occurs twice in $P$. Some authors relax this condition by permitting $v_{0}=v_{n}$. In this case the path is usually called a cycle.

Title simple path SimplePath 2013-03-22 12:30:42 2013-03-22 12:30:42 mps (409) mps (409) 6 mps (409) Definition msc 05C38 Path Cycle Graph PathConnected