Exhibit the Travelling Salesman Problem and apply algorithms in solving it;

• •

• • •

• • •

• • •

This is a connected graph. Any two distinct

once?"

Its graph
 has an even degree. By Euler’s Theorem 1 (B),

has an odd degree. Thus, Euler’s Theorem 1 (A) says

Only vertices D and E have odd degrees. Hence, by Euler’s Theorem 2 (B),
has at least one Euler circuit. Thus, it has an Euler path.
Start at any vertex.
Standing on G, (G, F) is a bridge. Since there are no other edges adjacent to F, take (G, F).

Standing on F, (F, D) is a bridge. Since it is the only remaining edge of the graph adjacent to F,
 Using Fleury’s Algorithm, find an Euler Path in this graph.

Omitting (D, G) in the graph, standing on G makes edge (G, F) a bridge, yet the only edge to F.
 Standing on A, (A, E) is a bridge. Since it is the only remaining edge of the graph adjacent to F,

exactly once. A
has no Hamilton circuits.
Salesman Problem.

List all possible Hamilton circuits.

At vertex C, the edge with the least cost that is adjacent with C is (C, A) However, it leads back
With the five vertices already chosen, we have the Hamilton circuit A-B-C-D-E-A and the optimal cost
with weight 14. Pick
with weight 24. But,
as red).

The vertices A, C, D, L, M, N and O are not adjacent to A. Note that among these vertices, there

The vertices H, I, J, K, M and O are not adjacent to B. Note that among these vertices, there are

Vertices E, I and O are not adjacent to G. Also, none of them are adjacent. Thus, E, I and O will
A business man has to visit five cities A, B, C, D and E. The distance (in hundred miles) between