MYLAB MATH FOR EXCURSIONS IN MATHEMATIC
MYLAB MATH FOR EXCURSIONS IN MATHEMATIC
9th Edition
ISBN: 9780136415893
Author: Tannenbaum
bartleby

Videos

Textbook Question
Book Icon
Chapter 6, Problem 1E

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.

Chapter 6, Problem 1E, For the graph shown in Fig. 6-19, a.find three different Hamilton circuits. b.find a Hamilton path

F i g u r e 6 - 1 9

Expert Solution
Check Mark
To determine

(a)

To find:

Three Hamilton circuits for given graph.

Answer to Problem 1E

Solution:

The Hamilton circuit are A,B,D,C,E,F,G,A; A,G,B,D,C,E,F,A and A,D,B,E,C,F,G,A.

Explanation of Solution

Given:

The given figure is,

MYLAB MATH FOR EXCURSIONS IN MATHEMATIC, Chapter 6, Problem 1E , additional homework tip  1

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 A,B,D,C,E,F,G,A.

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 A,G,B,D,C,E,F,A.

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 A,D,B,E,C,F,G,A.

Conclusion:

Thus, the Hamilton circuits are A,B,D,C,E,F,G,A; A,G,B,D,C,E,F,A; A,D,B,E,C,F,G,A.

Expert Solution
Check Mark
To determine

(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 A,G,F,E,C,D,B.

Explanation of Solution

Given:

The given figure is,

MYLAB MATH FOR EXCURSIONS IN MATHEMATIC, Chapter 6, Problem 1E , additional homework tip  2

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 A,G,F,E,C,D,B.

Conclusion:

Thus, a Hamilton path that starts at A and ends at B is A,G,F,E,C,D,B.

Expert Solution
Check Mark
To determine

(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 D,C,E,B,G,A,F

Explanation of Solution

Given:

The given figure is,

MYLAB MATH FOR EXCURSIONS IN MATHEMATIC, Chapter 6, Problem 1E , additional homework tip  3

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 D,C,E,B,G,A,F.

Conclusion:

Thus, a Hamilton path that starts at D and ends at F is D,C,E,B,G,A,F.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
Q1/Details of square footing are as follows: DL = 800 KN, LL = 500 kN, Fy=414 MPa, Fc = 20 MPa Footing, qa = 120 kPa, Column (400x400) mm. Determine the dimensions of footing and thickness? Q2/ For the footing system shown in Figure below, find the suitable size (BxL) for: 1. Non uniform pressure, 2. Uniform pressure, 3.Uniform pressure with moment in clockwise direction. (Use qmax=qall =200kPa). Property, line M=200KN.m 1m P-1000KN
Refer to page 52 for solving the heat equation using separation of variables. Instructions: • • • Write the heat equation in its standard form and apply boundary and initial conditions. Use the method of separation of variables to derive the solution. Clearly show the derivation of eigenfunctions and coefficients. Provide a detailed solution, step- by-step. Link: [https://drive.google.com/file/d/1wKSrun-GlxirS31Z9qo Hazb9tC440AZF/view?usp=sharing]
Assume {u1, U2, 13, 14} spans R³. Select the best statement. A. {U1, U2, u3} never spans R³ since it is a proper subset of a spanning set. B. {U1, U2, u3} spans R³ unless one of the vectors is the zero vector. C. {u1, U2, us} spans R³ unless one of the vectors is a scalar multiple of another vector in the set. D. {U1, U2, us} always spans R³. E. {U1, U2, u3} may, but does not have to, span R³. F. none of the above

Chapter 6 Solutions

MYLAB MATH FOR EXCURSIONS IN MATHEMATIC

Ch. 6 - Consider the graph in Fig.6-27. a. Find all the...Ch. 6 - Prob. 12ECh. 6 - For the graph in Fig.6-29 a. find a Hamilton path...Ch. 6 - For the graph in Fig.6-30 a. find a Hamilton path...Ch. 6 - Explain why the graph shown in Fig.6-31 has...Ch. 6 - Explain why the graph shown in Fig.6-32 has...Ch. 6 - For the weighted shown in Fig 6-33, a.find the...Ch. 6 - For the weighted graph shown in Fig6-34, a.find...Ch. 6 - For the weighted graph shown in Fig6-35, a.find a...Ch. 6 - For the weighted graph shown in Fig6-36, a.find a...Ch. 6 - Suppose you have a supercomputer that can generate...Ch. 6 - Suppose you have a supercomputer that can generate...Ch. 6 - Prob. 23ECh. 6 - a. How many edges are there in K200? b. How many...Ch. 6 - In each case, find the value of N. a. KN has 120...Ch. 6 - In each case, find the value of N. a. KN has 720...Ch. 6 - Find an optimal tour for the TSP given in...Ch. 6 - Find an optimal tour for the TSP given in...Ch. 6 - A truck must deliver furniture to stores located...Ch. 6 - A social worker starts from her home A, must visit...Ch. 6 - You are planning to visit four cities A, B, C, and...Ch. 6 - An unmanned rover must be routed to visit four...Ch. 6 - For the weighted graph shown in Fig.6-41, i find...Ch. 6 - A delivery service must deliver packages at...Ch. 6 - Prob. 35ECh. 6 - A space mission is scheduled to visit the moons...Ch. 6 - This exercise refers to the furniture truck TSP...Ch. 6 - This exercise refers to the social worker TSP...Ch. 6 - Darren is a sales rep whose territory consists of...Ch. 6 - The Platonic Cowboys are a country and western...Ch. 6 - Find the repetitive nearest-neighbor tour and give...Ch. 6 - Prob. 42ECh. 6 - This exercise is a continuation of Darrens sales...Ch. 6 - This exercise is a continuation of the Platonic...Ch. 6 - Prob. 45ECh. 6 - Prob. 46ECh. 6 - Find the cheapest-link tour and give its cost for...Ch. 6 - Find the cheapest-link tour for the social worker...Ch. 6 - For the Brute-Force Bandits concert tour discussed...Ch. 6 - For the weighted graph shown in Fig.6-47, find the...Ch. 6 - For Darrens sales trip problem discussed in...Ch. 6 - For the Platonic Cowboys concert tour discussed in...Ch. 6 - A rover on the planet Mercuria has to visit six...Ch. 6 - A robotic laser must drill holes on five sites A,...Ch. 6 - Prob. 55ECh. 6 - Prob. 56ECh. 6 - Suppose that in solving a TSP you find an...Ch. 6 - Prob. 58ECh. 6 - Prob. 59ECh. 6 - Prob. 60ECh. 6 - Prob. 61ECh. 6 - If the number of edges in K500 is x and the number...Ch. 6 - Explain why the cheapest edge in any graph is...Ch. 6 - a. Explain why the graph that has a bridge cannot...Ch. 6 - Julie is the marketing manager for a small...Ch. 6 - 66. m by n grid graphs. An m by n grid graph...Ch. 6 - Complete bipartite graphs. A complete bipartite...Ch. 6 - Prob. 68ECh. 6 - Diracs theorem. If G is a connected graph with N...
Knowledge Booster
Background pattern image
Math
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning
Text book image
Algebra: Structure And Method, Book 1
Algebra
ISBN:9780395977224
Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:McDougal Littell
Graph Theory: Euler Paths and Euler Circuits; Author: Mathispower4u;https://www.youtube.com/watch?v=5M-m62qTR-s;License: Standard YouTube License, CC-BY
WALK,TRIAL,CIRCUIT,PATH,CYCLE IN GRAPH THEORY; Author: DIVVELA SRINIVASA RAO;https://www.youtube.com/watch?v=iYVltZtnAik;License: Standard YouTube License, CC-BY