There are a few concepts within graph theory that include walks, paths, trails and cycles. A walk on a graph is defined as a sequence of adjacent vertices where repetition is allowed. A path is a walk, however, no vertices can be repeated in this case. Within these two concepts, it is known that if a walk exists between \(x\) and \(y\), then a path also exists from \(x\) to \(y.\)