Discrete Mathematics With Applications
5th Edition
ISBN: 9781337694193
Author: EPP, Susanna S.
Publisher: Cengage Learning,
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 10.6, Problem 11ES
A pipeline is to be built that will link six cities. The cost (in hundreds of millions of dollars) of constructing each potential link depends on distance and terrain and is shown in the weighted graph below. Find a system of pipelines to connect all the cities and yet minimize the total cost.
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
The following table contains information on the cost to run three jobs on four available machines.Compute the total cost
A Gallup survey showed that in March
2011
,
8
of every
25
employers in the United States were adding more workers to their workforce,
9
of
50
were reducing their workforce, and
1
of
2
were keeping it the same. In a metropolitan area there are
1250
employers and of those who will hire, they will hire an average of seven new employees. If the employers who were cutting their workforce in that area were planning on letting go an average of nine workers, what would the net change in jobs for the area be?
This metropolitan area would see a ▼net decrease or increase of
jobs.
You are the marketing director for a company that manufactures bodybuilding supplements and you are planning to run ads in Sports Illustrated and GQ Magazine. Based on readership data, you estimate that each one-page ad in Sports Illustrated will be read by 670,000 people in your target group, while each one-page ad in GQ will be read by 170,000. You would like your ads to be read by at least 3 million people in the target group and, to ensure the broadest possible audience, you would like to place at least three full-page ads in each magazine. Draw the feasible region that shows how many pages you can purchase in each magazine. (Let x be the number of full-page ads in Sports Illustrated and let y be the number of full-page ads in GQ Magazine.)
Find the corner points of the region. (Round each coordinate to the nearest whole number. If an answer does not exist, enter DNE.)
smaller x-value(x, y)
=
larger x-value(x, y)
=
Chapter 10 Solutions
Discrete Mathematics With Applications
Ch. 10.1 - Let G be a graph and let v and w be vertices in G....Ch. 10.1 - A graph is connected if, any only if, _____.Ch. 10.1 - Removing an edge from a circuit in a graph does...Ch. 10.1 - An Euler circuit in graph is _____.Ch. 10.1 - Prob. 5TYCh. 10.1 - Prob. 6TYCh. 10.1 - Prob. 7TYCh. 10.1 - If a graph G has a Hamiltonian circuit, then G has...Ch. 10.1 - A travelling salesman problem involves finding a...Ch. 10.1 - In the graph below, determine whether the...
Ch. 10.1 - In the graph below, determine whether the...Ch. 10.1 - Let G be the graph and consider the walk...Ch. 10.1 - Consider the following graph. How many paths are...Ch. 10.1 - Consider the following graph. How many paths are...Ch. 10.1 - An edge whose removal disconnects the graph of...Ch. 10.1 - Given any positive integer n, (a) find a connected...Ch. 10.1 - Find the number of connected components for each...Ch. 10.1 - Each of (a)—(c) describes a graph. In each case...Ch. 10.1 - Prob. 10ESCh. 10.1 - Is it possible for a citizen of Königsberg to make...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Is it possible to take a walk around the city...Ch. 10.1 - For each of the graph in 19-21, determine whether...Ch. 10.1 - Prob. 20ESCh. 10.1 - Prob. 21ESCh. 10.1 - Prob. 22ESCh. 10.1 - Prob. 23ESCh. 10.1 - Find the complement of each of the following...Ch. 10.1 - Find the complement of the graph K4, the complete...Ch. 10.1 - Suppose that in a group of five people A,B,C,D,...Ch. 10.1 - Prob. 27ESCh. 10.1 - Show that at a party with at least two people,...Ch. 10.1 - Find Hamiltonian circuits for each of the graph in...Ch. 10.1 - Find Hamiltonian circuits for each of the graph in...Ch. 10.1 - Prob. 31ESCh. 10.1 - Show that none of graphs in 31-33 has a...Ch. 10.1 - Prob. 33ESCh. 10.1 - Prob. 34ESCh. 10.1 - Prob. 35ESCh. 10.1 - In 34-37, find Hamiltonian circuits for those...Ch. 10.1 - Prob. 37ESCh. 10.1 - Give two examples of graphs that have Euler...Ch. 10.1 - Prob. 39ESCh. 10.1 - Prob. 40ESCh. 10.1 - Give two examples of graphs that have Euler...Ch. 10.1 - A traveler in Europe wants to visit each of the...Ch. 10.1 - a. Prove that if a walk in a graph contains a...Ch. 10.1 - Prob. 44ESCh. 10.1 - Prob. 45ESCh. 10.1 - Prob. 46ESCh. 10.1 - Prove that if there is a trail in a graph G from a...Ch. 10.1 - If a graph contains a circuits that starts and...Ch. 10.1 - Prob. 49ESCh. 10.1 - Let G be a connected graph, and let C be any...Ch. 10.1 - Prob. 51ESCh. 10.1 - Prob. 52ESCh. 10.1 - For what values of n dies the complete graph Kn...Ch. 10.1 - For what values of m and n does the complete...Ch. 10.1 - What is the maximum number of edges a simple...Ch. 10.1 - Prob. 56ESCh. 10.1 - Prob. 57ESCh. 10.2 - In the adjacency matrix for a directed graph, the...Ch. 10.2 - Prob. 2TYCh. 10.2 - Prob. 3TYCh. 10.2 - Prob. 4TYCh. 10.2 - Prob. 5TYCh. 10.2 - Prob. 6TYCh. 10.2 - Find real numbers a, b, and c such that the...Ch. 10.2 - Find the adjacency matrices for the following...Ch. 10.2 - Find directed graphs that have the following...Ch. 10.2 - Find adjacency matrices for the following...Ch. 10.2 - Find graphs that have the following adjacency...Ch. 10.2 - Prob. 6ESCh. 10.2 - Prob. 7ESCh. 10.2 - Prob. 8ESCh. 10.2 - Prob. 9ESCh. 10.2 - Prob. 10ESCh. 10.2 - Prob. 11ESCh. 10.2 - Prob. 12ESCh. 10.2 - Let O denote the matrix [0000] . Find 2 × 2...Ch. 10.2 - Prob. 14ESCh. 10.2 - Prob. 15ESCh. 10.2 - In 14-18, assume the entries of all matrices are...Ch. 10.2 - Prob. 17ESCh. 10.2 - Prob. 18ESCh. 10.2 - Prob. 19ESCh. 10.2 - The following is an adjacency matrix for a graph:...Ch. 10.2 - Let A be the adjacency matrix for K3, the complete...Ch. 10.2 - Draw a graph that has [0001200011000211120021100]...Ch. 10.2 - Prob. 23ESCh. 10.3 - If G and G’ are graphs, then G is isomorphic to G’...Ch. 10.3 - A property P is an invariant for graph isomorphism...Ch. 10.3 - Prob. 3TYCh. 10.3 - For each pair of graphs G and G’ in 1-5, determine...Ch. 10.3 - For each pair of graphs G and G’ in 1-5, determine...Ch. 10.3 - For each pair of graphs G and G’ in 1-5, determine...Ch. 10.3 - For each pair of graphs G and G’ in 1-5, determine...Ch. 10.3 - For each pair of graphs G and G in 1—5, determine...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - Prob. 9ESCh. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - For each pair of simple graphs G and G in 6—13,...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - Draw all nonisomorphic simple graphs with three...Ch. 10.3 - Draw all nonisomorphic simple graphs with four...Ch. 10.3 - Prob. 16ESCh. 10.3 - Draw all nonisomorphic graphs with four vertices...Ch. 10.3 - Draw all nonisomorphic graphs with four vertices...Ch. 10.3 - Prob. 19ESCh. 10.3 - Draw four nonisomorphic graphs with six vertices,...Ch. 10.3 - Prob. 21ESCh. 10.3 - Prove that each of the properties in 21-29 is an...Ch. 10.3 - Prob. 23ESCh. 10.3 - Prove that each of the properties in 21-29 is an...Ch. 10.3 - Prob. 25ESCh. 10.3 - Prob. 26ESCh. 10.3 - Prob. 27ESCh. 10.3 - Prove that each of the properties in 21-29 is an...Ch. 10.3 - Prob. 29ESCh. 10.3 - Show that the following two graphs are not...Ch. 10.4 - A circuit-free graph is a graph with __________.Ch. 10.4 - Prob. 2TYCh. 10.4 - Prob. 3TYCh. 10.4 - Prob. 4TYCh. 10.4 - Prob. 5TYCh. 10.4 - Prob. 6TYCh. 10.4 - For any positive integer n, if G is a connected...Ch. 10.4 - Read the tree in Example 10.4.2 from left to right...Ch. 10.4 - Prob. 2ESCh. 10.4 - Prob. 3ESCh. 10.4 - Prob. 4ESCh. 10.4 - Prob. 5ESCh. 10.4 - Prob. 6ESCh. 10.4 - Prob. 7ESCh. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - Prob. 14ESCh. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - Prob. 17ESCh. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - A connected graph has twelve vertices and eleven...Ch. 10.4 - A connected graph has nine vertices and twelve...Ch. 10.4 - Prob. 24ESCh. 10.4 - Prob. 25ESCh. 10.4 - If a graph has n vertices and n2 or fewer can it...Ch. 10.4 - A circuit-free graph has ten vertices and nine...Ch. 10.4 - Is a circuit-free graph with n vertices and at...Ch. 10.4 - Prob. 29ESCh. 10.4 - Prob. 30ESCh. 10.4 - a. Prove that the following is an invariant for...Ch. 10.5 - Prob. 1TYCh. 10.5 - Prob. 2TYCh. 10.5 - Prob. 3TYCh. 10.5 - Prob. 4TYCh. 10.5 - Prob. 5TYCh. 10.5 - Prob. 1ESCh. 10.5 - Prob. 2ESCh. 10.5 - Draw binary trees to represent the following...Ch. 10.5 - Prob. 4ESCh. 10.5 - Prob. 5ESCh. 10.5 - Prob. 6ESCh. 10.5 - Prob. 7ESCh. 10.5 - Prob. 8ESCh. 10.5 - Prob. 9ESCh. 10.5 - Prob. 10ESCh. 10.5 - Prob. 11ESCh. 10.5 - Prob. 12ESCh. 10.5 - Prob. 13ESCh. 10.5 - Prob. 14ESCh. 10.5 - Prob. 15ESCh. 10.5 - Prob. 16ESCh. 10.5 - Prob. 17ESCh. 10.5 - Prob. 18ESCh. 10.5 - Prob. 19ESCh. 10.5 - Prob. 20ESCh. 10.5 - Prob. 21ESCh. 10.5 - Prob. 22ESCh. 10.5 - Prob. 23ESCh. 10.5 - Prob. 24ESCh. 10.5 - In 21-25, use the steps of Algorithm 10.5.1 to...Ch. 10.6 - Prob. 1TYCh. 10.6 - Prob. 2TYCh. 10.6 - Prob. 3TYCh. 10.6 - In Kruskal’s algorithm, the edges of a connected,...Ch. 10.6 - Prob. 5TYCh. 10.6 - Prob. 6TYCh. 10.6 - At each stage of Dijkstra’s algorithm, the vertex...Ch. 10.6 - Prob. 1ESCh. 10.6 - Prob. 2ESCh. 10.6 - Prob. 3ESCh. 10.6 - Prob. 4ESCh. 10.6 - Prob. 5ESCh. 10.6 - Prob. 6ESCh. 10.6 - Prob. 7ESCh. 10.6 - Prob. 8ESCh. 10.6 - Prob. 9ESCh. 10.6 - Prob. 10ESCh. 10.6 - A pipeline is to be built that will link six...Ch. 10.6 - Use Dijkstra’s algorithm for the airline route...Ch. 10.6 - Use Dijkstra’s algorithm to find the shortest path...Ch. 10.6 - Use Dijkstra’s algorithm to find the shortest path...Ch. 10.6 - Use Dijkstra’s algorithm to find the shortest path...Ch. 10.6 - Use Dijkstra’s algorithm to find the shortest path...Ch. 10.6 - Prob. 17ESCh. 10.6 - Prob. 18ESCh. 10.6 - Prob. 19ESCh. 10.6 - Prob. 20ESCh. 10.6 - Prob. 21ESCh. 10.6 - Prob. 22ESCh. 10.6 - Prob. 23ESCh. 10.6 - Prob. 24ESCh. 10.6 - Prob. 25ESCh. 10.6 - Prob. 26ESCh. 10.6 - Prob. 27ESCh. 10.6 - Suppose a disconnected graph is input to Kruskal’s...Ch. 10.6 - Suppose a disconnected graph is input to Prim’s...Ch. 10.6 - Modify Algorithm 10.6.3 so that the output...Ch. 10.6 - Prob. 31ES
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
To allocate annual bonuses, a manager must choose his top four employees and rank them first to fourth. In how many ways can he create the ‘Top- Four” list out of the 32 employees?
arrow_forward
Twenty percent of the trees in a particular forest have a disease, 30% of the trees are too small to be used for lumber, and 40% are too small to be used for lumber or have a disease. What percent of the trees are too small to be used for lumber and have a disease?
arrow_forward
Suppose 60 percent of the customers at Pizza Palooza order a square pizza, 80 percent order a soft drink, and 48 percent order both a square pizza and a soft drink. Is ordering a soft drink independent of ordering a square pizza?
arrow_forward
We need to assign 4 students (Daniel, Jeremy, Xiaoying, Ashu) to 3 different teams (Team 1, Team 2, and Team 3). Each team needs to have at least 1 student. To maximize productivity, it has been determined that Ashu and Jeremy cannot be on the same team. How many different ways are there to assign the teams?
arrow_forward
What must be the reliability of each component in aseries system consisting of six components that must havea system reliability of 0.95?
arrow_forward
A fleet of 100 taxis is divided into two groups of 50 cars each to see whether premium gasoline reduces maintenance costs. Premium unleaded fuel is used in group A, while regular unleaded fuel is used in group B. The total maintenance cost for each vehicle during a one-year period is recorded. Premium fuel will be used if it is shown to reduce maintenance costs.
arrow_forward
A company has 19 new employees to train. The training methods consist of computer-based training, televised classes, and traditional classes. The company intends to maximize the number of employees that are trained without the traditional classes, but only 6 employees can be chosen for computer-based training, and 8 employees can be chosen for televised classes. In how many ways can the 19 employees be divided for training?
arrow_forward
Here are the countries with the five highest estimated costs of software piracy: United States ($9.1 billion), China ($8.7 billion), India ($2.7 billion), France ($2.1 billion), United Kingdom ($1.9 billion). Among these five countries, the United States has 37.1% of the cost of piracy. Is it correct to conclude that the United States has 37.1% of the total cost of piracy for all countries? What do these results tell us about the costs of piracy in the other countries not included here?
arrow_forward
The file MidCity Download MidCitycontains data on 128 recent sales in Mid City. For each sale, the file shows the neighborhood (1, 2, or 3) in which the house is located, the number of offers made on the house, the square footage, whether the house is made primarily of brick, the number of bathrooms, the number of bedrooms, and the selling price. Neighborhoods 1 and 2 are more traditional neighborhoods, whereas neighborhood 3 is a newer, more prestigious neighborhood.
Part A) Do buyers pay a premium for a brick house, all else being equal? Use one Excel spreadsheet labeled Prob3a to show your work for this problem.
Part B) Is there a premium for a house in neighborhood 3, all else being equal? Use one Excel spreadsheet labeled Prob3b to show your work for this problem.
Home
Nbhd
Offers
Sq Ft
Brick
Bedrooms
Bathrooms
Price
1
2
2
1790
No
2
2
228600
2
2
3
2030
No
4
2
228400
3
2
1
1740
No
3
2
229600
4
2
3
1980
No
3
2
189400
5
2
3
2130
No
3
3
239600
6
1
2
1780
No
3
2
229200…
arrow_forward
The file MidCity Download MidCitycontains data on 128 recent sales in Mid City. For each sale, the file shows the neighborhood (1, 2, or 3) in which the house is located, the number of offers made on the house, the square footage, whether the house is made primarily of brick, the number of bathrooms, the number of bedrooms, and the selling price. Neighborhoods 1 and 2 are more traditional neighborhoods, whereas neighborhood 3 is a newer, more prestigious neighborhood.
Home
Nbhd
Offers
Sq Ft
Brick
Bedrooms
Bathrooms
Price
1
2
2
1790
No
2
2
228600
2
2
3
2030
No
4
2
228400
3
2
1
1740
No
3
2
229600
4
2
3
1980
No
3
2
189400
5
2
3
2130
No
3
3
239600
6
1
2
1780
No
3
2
229200
7
3
3
1830
Yes
3
3
303200
8
3
2
2160
No
4
2
301400
9
2
3
2110
No
4
2
238400
10
2
3
1730
No
3
3
208000
11
2
3
2030
Yes
3
2
265000
12
2
2
1870
Yes
2
2
246000
13
1
4
1910
No
3
2
205200
14
1
5
2150
Yes
3
3
252600
15
3
4
2590
No
4
3
353600
16
3
1
1780
No
4
2
291600
17
2
4
2190
Yes
3
3…
arrow_forward
Determine the total weight of the minimum Hamilton circuits? 
arrow_forward
A line of LRT with five (5) stations will be constructed in a city. A forecast passenger demand is given below:
Depart Station
Boarding Station
1
2
3
4
5
1
0
1600
10000
2000
250
2
230
0
11000
2071
230
3
60
1400
0
1500
170
4
250
1700
10400
0
250
5
300
1900
12000
2500
0
(a) Compute the number of passengers between each pair of the stations for both directions.(b) In this LRT project, headway must not be less than 120 seconds and must not be greater than 300 seconds. All stations are designed to cater a train of 6 couches. The capacity of each couch is 280 passengers. Based on the computed maximum passengers in (a), compute headway possibilities and corresponding number of couches per train. You may use rail utilisation factor of 0.75 and load factor of 0.9.
arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Glencoe Algebra 1, Student Edition, 9780079039897...
Algebra
ISBN:9780079039897
Author:Carter
Publisher:McGraw Hill
Glencoe Algebra 1, Student Edition, 9780079039897...
Algebra
ISBN:9780079039897
Author:Carter
Publisher:McGraw Hill
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