Solution Found!
Suppose D, G, E, A, H, C, B, F, D is a Hamilton circuit in a graph. (a) Find the number
Chapter 6, Problem 7(choose chapter or problem)
Suppose D, G, E, A, H, C, B, F, D is a Hamilton circuit in a graph. (a) Find the number of vertices in the graph. (b) Write the Hamilton circuit using A as the starting/ ending vertex. (c) Find two different Hamilton paths in the graph that start at A.
Questions & Answers
QUESTION:
Suppose D, G, E, A, H, C, B, F, D is a Hamilton circuit in a graph. (a) Find the number of vertices in the graph. (b) Write the Hamilton circuit using A as the starting/ ending vertex. (c) Find two different Hamilton paths in the graph that start at A.
ANSWER:Step 1 of 3
(a)
Note that the Hamilton circuit visits each vertex exactly once and that we write it so that the one vertex appears at the beginning and the end of the list.
There is nine vertices in the list, the first and last being the same, we have on the graph.