Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)
3rd Edition
ISBN: 9780134689555
Author: Edgar Goodaire, Michael Parmenter
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 11, Problem 2RE
To determine
The Chinese Postman Problem for the weighted graph given in Exercise 24 of the Chapter 10 Review Problems.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
In a study of fourth, fifth and sixth graders, the following data were collected on their gender and their primary goal.
Primary Goal
Gender
Good Grades (G)
Popularity (P)
Good at Sports (S)
Row Totals
Male (M)
113
53
55
221
Female (F)
132
89
26
247
Column Totals
245
142
81
468
a) Since data were collected for variable(s), the correct graph to make is a
b) Which of the following is the correct graph for the above data with Primary Goal grouped by Gender.
(If using a screenreader and you cannot see the options, use "message instructor" and include a copy of your graph for hand grading.)
A person starting in Columbus must visit Great Falls, Odessa, and
Brownsville (although not necessarily in that order), and then return home to
Columbus in one car trip. The road mileage between the cities is shown.
Great Falls
Columbus
Odessa
Brownsville
Columbus
102
79
56
---
Great Falls
102
47
69
---
Odessa
79
47
72
---
Brownsville
56
69
72
a) Draw a weighted graph that represents this problem in the space below. Use
the first letter of the city when labeling each vertex.
b) Find the weight (distance) of the Hamiltonian circuit formed using the nearest
neighbor algorithm. Give the vertices in the circuit in the order they are
visited in the circuit as well as the total weight (distance) of the circuit.
Remember to include the unit of measure in your final answer.
4.
Find a Hamiltonian circuit in the following graph. (There is more than
one possible answer.) Either clearly mark the path you take with directional
arrows and numbers or list the vertices in the order that you visit…
Homework questions based on problems from Gravetter and Wallnau (2014)Chapter 10 Homework QuestionsPlease note: These questions were taken from an earlier edition of the textbook and areidentified by the original question numbers (for record-keeping purposes), which is why thequestion numbers are not sequential.1)Describe the basic characteristics of an independent-measures (also known as “betweensubjects” or “between-groups”) research study.2)Describe what is measured by the estimated standard error in the bottom of the independentmeasures t statistic.6)One sample has SS = 70 and a second sample has SS = 42.a) If n = 8 for both samples, find each of the sample variances, and calculate the pooledvariance. Because samples are the same size, you should find that the pooledvariance is exactly halfway between the two sample variances.b) Now assume that n = 8 for the first sample and n = 4 for the second. Again, calculatethe two sample variances and the pooled variance. You should find that…
Chapter 11 Solutions
Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)
Ch. 11.1 - Prob. 1TFQCh. 11.1 - Prob. 2TFQCh. 11.1 - Prob. 3TFQCh. 11.1 - In a graph G with two odd vertices, 1 and 2 , the...Ch. 11.1 - If a graph G has six odd vertices, to solve the...Ch. 11.1 - Prob. 6TFQCh. 11.1 - Prob. 7TFQCh. 11.1 - In the weighted graph the Chinese Postman Problem...Ch. 11.1 - Prob. 9TFQCh. 11.1 - In the unweighted graph n, n odd, the Chinese...
Ch. 11.1 - Solve the Chinese Postman Problem for each of the...Ch. 11.1 - Prob. 2ECh. 11.1 - 3. [BB] Solve the Chinese Postman Problem for the...Ch. 11.1 - In a graph G with two odd vertices, 1 and 2 , the...Ch. 11.1 - Solve the Chinese Postman Problem for each of the...Ch. 11.1 - Prob. 6ECh. 11.1 - Prob. 7ECh. 11.1 - Solve the Chinese Postman Problem for the weighted...Ch. 11.1 - Prob. 9ECh. 11.1 - Prob. 10ECh. 11.1 - Prob. 11ECh. 11.1 - Prob. 12ECh. 11.2 - Prob. 1TFQCh. 11.2 - Prob. 2TFQCh. 11.2 - Prob. 3TFQCh. 11.2 - Prob. 4TFQCh. 11.2 - Prob. 5TFQCh. 11.2 - Prob. 6TFQCh. 11.2 - Prob. 7TFQCh. 11.2 - Prob. 8TFQCh. 11.2 - Prob. 9TFQCh. 11.2 - Prob. 10TFQCh. 11.2 - Prob. 1ECh. 11.2 - Prob. 2ECh. 11.2 - Prob. 3ECh. 11.2 - Prob. 4ECh. 11.2 - Prob. 5ECh. 11.2 - Prob. 6ECh. 11.2 - Prob. 7ECh. 11.2 - Prob. 8ECh. 11.2 - Prob. 9ECh. 11.2 - Prove Theorem 11.2.4: A digraph is Eulerian if and...Ch. 11.2 - Prob. 11ECh. 11.2 - Prob. 12ECh. 11.2 - 13. Label the vertices of each pair of digraphs in...Ch. 11.2 - 14. Consider the digraphs , shown.
(a) Find the...Ch. 11.2 - The answers to exercises marked [BB] can be found...Ch. 11.2 - In each of the following cases, find a permutation...Ch. 11.2 - Prob. 17ECh. 11.2 - Prob. 18ECh. 11.2 - [BB] if a graph G is connected and some...Ch. 11.2 - Prob. 20ECh. 11.2 - Prob. 21ECh. 11.2 - Prob. 22ECh. 11.2 - Prob. 23ECh. 11.2 - [BB] Apply the original form of Dijkstras...Ch. 11.2 - Prob. 25ECh. 11.2 - Prob. 26ECh. 11.2 - Prob. 27ECh. 11.2 - Prob. 28ECh. 11.2 - [BB] The Bellman-Ford algorithm can be terminated...Ch. 11.2 - Prob. 30ECh. 11.2 - Prob. 31ECh. 11.2 - Prob. 32ECh. 11.2 - Prob. 33ECh. 11.3 - Prob. 1TFQCh. 11.3 - Prob. 2TFQCh. 11.3 - Prob. 3TFQCh. 11.3 - Prob. 4TFQCh. 11.3 - Prob. 5TFQCh. 11.3 - Prob. 6TFQCh. 11.3 - Prob. 7TFQCh. 11.3 - Prob. 8TFQCh. 11.3 - Prob. 9TFQCh. 11.3 - Prob. 1ECh. 11.3 - Prob. 2ECh. 11.3 - Prob. 3ECh. 11.3 - Prob. 4ECh. 11.3 - Prob. 5ECh. 11.4 - Prob. 1TFQCh. 11.4 - Prob. 2TFQCh. 11.4 - Prob. 3TFQCh. 11.4 - Prob. 4TFQCh. 11.4 - Prob. 5TFQCh. 11.4 - Prob. 6TFQCh. 11.4 - Prob. 7TFQCh. 11.4 - Prob. 8TFQCh. 11.4 - Prob. 9TFQCh. 11.4 - Prob. 10TFQCh. 11.4 - Prob. 1ECh. 11.4 - Prob. 2ECh. 11.4 - Prob. 3ECh. 11.4 - Prob. 4ECh. 11.4 - Prob. 5ECh. 11.4 - Prob. 6ECh. 11.4 - Prob. 7ECh. 11.4 - Prob. 8ECh. 11.4 - Prob. 9ECh. 11.4 - Prob. 10ECh. 11.4 - Prob. 11ECh. 11.4 - Prob. 12ECh. 11.5 - Prob. 1TFQCh. 11.5 - Prob. 2TFQCh. 11.5 - Prob. 3TFQCh. 11.5 - Prob. 4TFQCh. 11.5 - Prob. 5TFQCh. 11.5 - Prob. 6TFQCh. 11.5 - Prob. 7TFQCh. 11.5 - Prob. 8TFQCh. 11.5 - Prob. 9TFQCh. 11.5 - 10. In a type scheduling problem, a vertex that...Ch. 11.5 - Prob. 1ECh. 11.5 - [BB] The construction of a certain part in an...Ch. 11.5 - Prob. 3ECh. 11.5 - Prob. 4ECh. 11.5 - Prob. 5ECh. 11.5 - 6.(a) Find two different orientations on the edges...Ch. 11.5 - Prob. 7ECh. 11.5 - 8. Repeat Exercise 7 if, in addition to all the...Ch. 11.5 - Repeat Exercise 7 if A takes 6 months to complete...Ch. 11.5 - Prob. 10ECh. 11.5 - Prob. 11ECh. 11.5 - Prob. 12ECh. 11.5 - Prob. 13ECh. 11.5 - Prob. 14ECh. 11.5 - Prob. 15ECh. 11.5 - Prob. 16ECh. 11.5 - 17. The computer systems manager in mathematics...Ch. 11 - Solve the Chinese Postman Problem for the two...Ch. 11 - Prob. 2RECh. 11 - 3. Solve the Chinese Postman Problem for the...Ch. 11 - Prob. 4RECh. 11 - Prob. 5RECh. 11 - Prob. 6RECh. 11 - Prob. 7RECh. 11 - Prob. 8RECh. 11 - Prob. 9RECh. 11 - 11. Let and assume that the complete graph has...Ch. 11 - Prob. 11RECh. 11 - Prob. 12RECh. 11 - Prob. 13RECh. 11 - Prob. 14RECh. 11 - Use a version of Dijkstras algorithm to find a...Ch. 11 - Prob. 16RECh. 11 - Prob. 17RECh. 11 - Prob. 18RECh. 11 - Prob. 19RECh. 11 - 20. The following chart lists a number of tasks...Ch. 11 - Prob. 21RE
Knowledge Booster
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
- In a study of fourth, fifth and sixth graders, the following data were collected on their gender and their primary goal. a) Since data were collected for variable(s), the correct graph to make is a b) Which of the following is the correct graph for the above data with Primary Goal grouped by Gender. (If using a screenreader and you cannot see the options, use "message instructor" and include a copy of your graph for hand grading.)arrow_forwardPlease submit the graph, the graph of the problem transformed into atransportation problem, and transportation problem mathematical formulationarrow_forwardSketch 4 different bar graphs to depict each of the following possible results in a 2 x 2 factorial experiment: No main effect of A; no main effect of B; no interaction Main effect of A; no main effect of B; no interaction No main effect of A; main effect of B; no interaction Main effect of A; main effect of B; no interaction Submit your graphs as an Excel workbook, with each graph on its own sheet.arrow_forward
- If the results of a two-factor experiment are presented in a line graph, then what pattern appears in the graph if there is an interaction? the lines in the graph are bent there is a space separating the lines the lines are parallel the lines move toward each other or crossarrow_forwardSolve A and B. Sketch a graph!!!arrow_forwardI'm looking at the coefficents between two variables on Excel. Copying and pasting is not recommended by my professor. Can anyone give me an idea on how to graph it?arrow_forward
- Question 1 a) Prepare the bar plot of variable 1. b) Prepare the pie drawing of variable number 2. c) Prepare a cross chart of your variables 1 and 2 and draw a clustered bar. Variable 1: HEI 2005, mobility level of participants (Source: Paul Newbold, Statistics for Business and Economics, translation from 8th edition, translation: Umit Şenesen). MOBILITY LEVEL PARTICIPANTS Still 2183 Active 757 Energetic 1520 Variant 2: HEI 2005, gender of the participants (Source: Paul Newbold, Statistics for Business and Economics, translation from 8th edition, translation: Ümit Şenesen). GENDER PARTICIPANTS Woman 2321 Male 2139arrow_forwardThe following figure is from a paper about the role of the visual environment on attention & learning. What story does this graph tell -- what is the main result?arrow_forwardBased on the graph rank the three economic variables listed below from most important to least important.Provide one relevant reason to justify your selection for each of the threepositions.arrow_forward
- A person starting in Columbus must visit Great Falls, Odessa, and Brownsville (although not necessarily in that order), and then return home to Columbus in one car trip. The road mileage between the cities is shown. 3. Columbus Great Falls Odessa Brownsville Columbus 102 79 56 --- Great Falls 102 47 69 --- Odessa 79 47 72 ---- Brownsville 56 69 72 a) Draw a weighted graph that represents this problem in the space below. Use the first letter of the city when labeling each vertex. b) Find the weight (distance) of the Hamiltonian circuit formed using the nearest neighbor algorithm. Give the vertices in the circuit in the order they are visited in the circuit as well as the total weight (distance) of the circuit. Remember to include the unit of measure in your final answer. Find a Hamiltonian circuit in the following graph. (There is more than one possible answer.) Either clearly mark the path you take with directional arrows and numbers or list the vertices in the order that you visit…arrow_forwardhstructions: Complete the following problems neatly on your own paper. Make sure to label your preimage and image on your graph. Each problem will be graded on the following Rubric 1 Point: Only the preimage was graphed. 2 Points: Graphed but had minor errors (i.e. missed one point). 3 Points: Clear graph of preimage and image was given and fully correct. Problems You can use your own graph paper or download and print this graph paper (PDF, 15kb). For each problem, complete the translation, reflection, or rotation given the coordinates. Problem 1 Dilation: Coordinates: A(2, -4), B(2,-2), C(4,0), D(4,-4) Problem 2 Dilation: 2 Coordinates: A(-2, 1), B(-2,-1),C(1, 1), D(1, -1) Problem 3 Reflection: Reflection over the a-axis, and a translation of shifting right 5 units. Find the coordinates of and graph the new image. Coordinates: A(-2, -4), B(-3,-2). C(-5,-3) Problem 4 Given the coordinates, complete the double reflection over the lines a = 0 follow by a = -2. Find the coordinates of and…arrow_forwardhstructions: Complete the following problems neatly on your own paper. Make sure to label your preimage and image on your graph. Each problem will be graded on the following Rubric 1 Point: Only the preirmage was graphed. 2 Points: Graphed but had minor errors (i.e. missed one point). 3 Points: Clear graph of preimage and image was given and fully correct. Problems You can use your own graph paper or download and print this graph paper (PDF, 15kb). For each problem, complete the translation, reflection, or rotation given the coordinates. Problem 1 Dilation: Coordinates: A(2,-4), B(2,-2), C(4,0), D(4,-4) Problem 2 Dilation: 2 Coordinates: A(-2, 1), B(-2, -1),C(1,1), D(1, –1) Problem 3 Reflection: Reflection over the r-axis, and a translation of shifting right 5 units. Find the coordinates of and graph the new image. Coordinates: A(-2,-4), B(-3,-2),C(-5,-3) Problem 4 Given the coordinates, complete the double reflection over the lines x=0 follow by z = -2. Find the coordinates of and…arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Discrete Mathematics and Its Applications ( 8th I...MathISBN:9781259676512Author:Kenneth H RosenPublisher:McGraw-Hill EducationMathematics for Elementary Teachers with Activiti...MathISBN:9780134392790Author:Beckmann, SybillaPublisher:PEARSON
- Thinking Mathematically (7th Edition)MathISBN:9780134683713Author:Robert F. BlitzerPublisher:PEARSONDiscrete Mathematics With ApplicationsMathISBN:9781337694193Author:EPP, Susanna S.Publisher:Cengage Learning,Pathways To Math Literacy (looseleaf)MathISBN:9781259985607Author:David Sobecki Professor, Brian A. MercerPublisher:McGraw-Hill Education
Discrete Mathematics and Its Applications ( 8th I...
Math
ISBN:9781259676512
Author:Kenneth H Rosen
Publisher:McGraw-Hill Education
Mathematics for Elementary Teachers with Activiti...
Math
ISBN:9780134392790
Author:Beckmann, Sybilla
Publisher:PEARSON
Thinking Mathematically (7th Edition)
Math
ISBN:9780134683713
Author:Robert F. Blitzer
Publisher:PEARSON
Discrete Mathematics With Applications
Math
ISBN:9781337694193
Author:EPP, Susanna S.
Publisher:Cengage Learning,
Pathways To Math Literacy (looseleaf)
Math
ISBN:9781259985607
Author:David Sobecki Professor, Brian A. Mercer
Publisher:McGraw-Hill Education
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