Walks, Paths and Cycles

  • W. D. Wallis


A walk in a graph G is a finite sequence of vertices x0, x1, ..., x n and edges a1, a2, ..., a n of G:
$$ x_0 ,a_1 ,x_1 ,a_2 ,...,a_n ,x_n , $$
where the endpoints of a i are xi−1 and x i and x i for each i . A simple walk is a walk in which no edge is repeated. If it is desired to specify the terminal vertices, the above walk is called an x0x n -walk. The length of a walk is its number of edges.


Short Path Bipartite Graph Connected Graph Travel Salesman Problem Edge Incident 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Second Edition, Birkhäuser Boston 2007

Authors and Affiliations

  • W. D. Wallis
    • 1
  1. 1.Department of MathematicsSouthern Illinois UniversityCarbondaleUSA

Personalised recommendations