A walk in a graph G is a finite sequence of vertices x0, x1, ..., x n and edges a1, a2, ..., a n of G:
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.
$$ x_0 ,a_1 ,x_1 ,a_2 ,...,a_n ,x_n , $$
KeywordsShort Path Bipartite Graph Connected Graph Travel Salesman Problem Edge Incident
Unable to display preview. Download preview PDF.
© Second Edition, Birkhäuser Boston 2007