For the graph shown in Fig. 6-19,
a. find three different Hamilton circuits.
b. find a Hamilton path that starts at A and ends at B.
c. find a Hamilton path that starts at D and ends at F.
(a)
To find:
Three Hamilton circuits for given graph.
Answer to Problem 1E
Solution:
The Hamilton circuit are
Explanation of Solution
Given:
The given figure is,
Approach:
A Hamilton circuit is the circuit that starts and ends at the same vertex and includes every other vertex of the graph only once.
Calculation:
Let’s start with vertex A the options to go forward are vertices B, D, F, and G, go to vertex B. From vertex B the options to move further are C, D, E, and G, go to vertex D. From vertex D the option to go forward is vertex C. From vertex C the option to move forward to is E. From vertex E the option to move forward to is F. From vertex F the option to move forward to is G. From vertex G the option to move forward to is A.
The Hamilton circuit is
Let’s start with vertex A the options to go forward are vertices B, D, F, and G, go forward with vertex G. From vertex G the options to move further are B and F, go forward with vertex B. From vertex B the options to go forward are vertices C, D, and E, go to vertex D. From vertex D the option to move forward to is C. From vertex C the option to move forward to is E. From vertex E the option to move forward to is F. From vertex F the option to move forward to is A.
The Hamilton circuit is
Let’s start with vertex A the options to go forward are vertices B, D, F, and G, go forward with vertex D. From vertex D the options to move further are B and C, go forward with vertex B. From vertex B the options to go forward are vertex C and E, go to vertex E. From vertex E the option to move forward to is C. From vertex C the option to move forward to is F. From vertex F the option to move forward to is G. From vertex G the option to move forward to is A.
The Hamilton circuit is
Conclusion:
Thus, the Hamilton circuits are
(b)
To find:
A Hamilton path that starts at A and ends at B.
Answer to Problem 1E
Solution:
A Hamilton path that starts at A and ends at B is
Explanation of Solution
Given:
The given figure is,
Approach:
A Hamilton path is the path that includes every other vertex of the graph only once.
Calculation:
Let’s start with vertex A the options to go forward are vertices B, D, F, and G, go forward with vertex G. From vertex G the options to move further are B and F, go forward with vertex F. From vertex F the options to go forward are vertex C, E, and G, go to vertex E. From vertex E the option to move forward to are B and C, go to vertex C. From vertex C the option to move forward to are B and D, go to vertex D. From vertex D the option to move forward to is B.
The Hamilton path is
Conclusion:
Thus, a Hamilton path that starts at A and ends at B is
(c)
To find:
A Hamilton path that starts at D and ends at F.
Answer to Problem 1E
Solution:
A Hamilton path that starts at D and ends at F is
Explanation of Solution
Given:
The given figure is,
Approach:
A Hamilton path is the path that includes every other vertex of the graph only once.
Calculation:
Let’s start with vertex D the options to go forward are vertices A, B, C, go forward with vertex C. From vertex C the options to move further are B, E and F, go forward with vertex E. From vertex E the options to go forward are vertex B and F, go to vertex B. From vertex B the option to move forward to are A and G, go to vertex G. From vertex G the option to move forward to are A and F, go to vertex A. From vertex A the option to move forward to is F.
The Hamilton path is
Conclusion:
Thus, a Hamilton path that starts at D and ends at F is
Want to see more full solutions like this?
Chapter 6 Solutions
Excursions in Mathematics, Loose-Leaf Edition Plus MyLab Math with Pearson eText -- 18 Week Access Card Package
Additional Math Textbook Solutions
The Heart of Mathematics: An Invitation to Effective Thinking
Finite Mathematics with Applications In the Management, Natural, and Social Sciences (12th Edition)
Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991
Finite Mathematics (11th Edition)
Probability and Statistics for Engineers and Scientists
- Which are circuits in the graph? If not, why not? (a) E→ F→ A B C D (b) B→CD F→A → B (c) A D E F→A (d) CD F→B →D (e) F→E F→D→E→F — B D OA. Yes, it is a circuit. OB. No, it is not a circuit. It does not begin and end at the same vertex. OC. No, it is not a circuit. The edge joining vertices is used more than once. (Use a comma to separate answers as needed.) F (Use a comma to separate answers as needed.) (d) Is CD → F→B→ Da circuit? Select the correct choice below and, if necessary, fill in the answer box to complete your choice. OA. Yes, it is a circuit. OB. No, it is not a circuit. The edge joining vertices is used more than once. (Use a comma to separate answers as needed.) OC. No, it is not a circuit. There is no edge joining vertices (Use a comma to separate answers as needed.) OD. No, it is not a circuit. It does not begin and end at the same vertex. E G OD. No, it is not a circuit. There is no edge joining vertices (Use a comma to separate answers as needed.) (e) Is F→ E→F→D E F…arrow_forwardUse the figure below to answer the following question(s). E B B B #4 D G OE OE F F Graph 1 Graph 2 Graph 3 Which of the graphs has an Euler path but no Euler circuit? Select one: a. Graph 2 only b. Graph 3 only C. none of these d. Graphs 1 and 2 e. Graph 1 onlyarrow_forwardRefer to the figure below. a. Find a closed path of length 4 starting at vertex v2. b. Find a cycle of length 5 starting at vertex V1. c. Find a circuit that is not a cycle at vertex V4. VI V6 V5 V2 VA V 3arrow_forward
- Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage LearningAlgebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell