Mathematical Excursions (MindTap Course List)
Mathematical Excursions (MindTap Course List)
4th Edition
ISBN: 9781305965584
Author: Richard N. Aufmann, Joanne Lockwood, Richard D. Nation, Daniel K. Clegg
Publisher: Cengage Learning
Question
Book Icon
Chapter 5.4, Problem 8ES
To determine

The fewest possible number of colours to colour the map using graph colouring.

Blurred answer
Students have asked these similar questions
A body of mass m at the top of a 100 m high tower is thrown vertically upward with an initial velocity of 10 m/s. Assume that the air resistance FD acting on the body is proportional to the velocity V, so that FD=kV. Taking g = 9.75 m/s2 and k/m = 5 s, determine: a) what height the body will reach at the top of the tower, b) how long it will take the body to touch the ground, and c) the velocity of the body when it touches the ground.
A chemical reaction involving the interaction of two substances A and B to form a new compound X is called a second order reaction. In such cases it is observed that the rate of reaction (or the rate at which the new compound is formed) is proportional to the product of the remaining amounts of the two original substances. If a molecule of A and a molecule of B combine to form a molecule of X (i.e., the reaction equation is A + B ⮕ X), then the differential equation describing this specific reaction can be expressed as: dx/dt = k(a-x)(b-x) where k is a positive constant, a and b are the initial concentrations of the reactants A and B, respectively, and x(t) is the concentration of the new compound at any time t. Assuming that no amount of compound X is present at the start, obtain a relationship for x(t). What happens when t ⮕∞?
Consider a body of mass m dropped from rest at t = 0. The body falls under the influence of gravity, and the air resistance FD opposing the motion is assumed to be proportional to the square of the velocity, so that FD = kV2. Call x the vertical distance and take the positive direction of the x-axis downward, with origin at the initial position of the body. Obtain relationships for the velocity and position of the body as a function of time t.

Chapter 5 Solutions

Mathematical Excursions (MindTap Course List)

Ch. 5.1 - Determine (a) the number of edges in the graph,...Ch. 5.1 - Determine (a) the number of edges in the graph,...Ch. 5.1 - Determine (a) the number of edges in the graph,...Ch. 5.1 - Determine whether the two graphs are equivalent.Ch. 5.1 - Determine whether the two graphs are equivalent.Ch. 5.1 - Determine whether the two graphs are equivalent.Ch. 5.1 - Determine whether the two graphs are equivalent.Ch. 5.1 - Explain why the following two graphs cannot be...Ch. 5.1 - Label the vertices of the second graph so that it...Ch. 5.1 - (a) determine whether the graph is Eulerian. If it...Ch. 5.1 - (a) determine whether the graph is Eulerian. If it...Ch. 5.1 - (a) determine whether the graph is Eulerian. If it...Ch. 5.1 - (a) determine whether the graph is Eulerian. If it...Ch. 5.1 - (a) determine whether the graph is Eulerian. If it...Ch. 5.1 - (a) determine whether the graph is Eulerian. If it...Ch. 5.1 - (a) determine whether the graph is Eulerian. If it...Ch. 5.1 - (a) determine whether the graph is Eulerian. If it...Ch. 5.1 - Parks in Exercises 23 and 24, a map of a park is...Ch. 5.1 - Parks in Exercises 23 and 24, a map of a park is...Ch. 5.1 - Transportation For the train routes given in...Ch. 5.1 - Transportation For the direct air flights given in...Ch. 5.1 - Pets The diagram below shows the arrangement of a...Ch. 5.1 - Transportation A subway map is shown below. Is it...Ch. 5.1 - Prob. 29ESCh. 5.1 - Prob. 30ESCh. 5.1 - Degrees of Separation In the graph below, an edge...Ch. 5.1 - Social Network In the graph below, an edge...Ch. 5.1 - Prob. 33ESCh. 5.1 - Travel A map of South America is shown at the...Ch. 5.2 - Continue investigating Hamiltonian circuits in...Ch. 5.2 - Use the greedy algorithm and the weighted graph...Ch. 5.2 - Use the edge-picking algorithm to find a...Ch. 5.2 - Use Dirac's theorem to verify that the graph is...Ch. 5.2 - Use Dirac's theorem to verify that the graph is...Ch. 5.2 - Use Dirac's theorem to verify that the graph is...Ch. 5.2 - Use Dirac's theorem to verify that the graph is...Ch. 5.2 - Transportation For the train routes given in...Ch. 5.2 - Transportation For the direct air flights given in...Ch. 5.2 - Use trial and error to find two Hamiltonian...Ch. 5.2 - Use trial and error to find two Hamiltonian...Ch. 5.2 - Use trial and error to find two Hamiltonian...Ch. 5.2 - Use trial and error to find two Hamiltonian...Ch. 5.2 - Use the greedy algorithm to find a Hamiltonian...Ch. 5.2 - Use the greedy algorithm to find a Hamiltonian...Ch. 5.2 - Use the greedy algorithm to find a Hamiltonian...Ch. 5.2 - Use the greedy algorithm to find a Hamiltonian...Ch. 5.2 - Use the edge-picking algorithm to find a...Ch. 5.2 - Use the edge-picking algorithm to find a...Ch. 5.2 - Use the edge-picking algorithm to find a...Ch. 5.2 - Use the edge-picking algorithm to find a...Ch. 5.2 - Travel A company representative lives in...Ch. 5.2 - Travel A tourist is staying in Toronto, Canada,...Ch. 5.2 - Travel Use the edge-picking algorithm to design a...Ch. 5.2 - Travel Use the edge-picking algorithm to design a...Ch. 5.2 - Travel Nicole wants to tour Asia. She will start...Ch. 5.2 - Travel The prices for traveling between five...Ch. 5.2 - Travel Use the edge-picking algorithm to find a...Ch. 5.2 - Travel Use the edge-picking algorithm to find a...Ch. 5.2 - Route Planning Brian needs to visit the pet store,...Ch. 5.2 - Route Planning A bike messenger needs to deliver...Ch. 5.2 - Scheduling A research company has a large...Ch. 5.2 - Computer Networks A small office wishes to network...Ch. 5.2 - Route Planning A security officer patrolling a...Ch. 5.2 - Route Planning A city engineer needs to inspect...Ch. 5.2 - Draw a connected graph with six vertices that has...Ch. 5.2 - Assign weights to the edges of the following...Ch. 5.3 - The tetrahedron in figure 5.20 consists of four...Ch. 5.3 - The following graph is the projection of one ofthe...Ch. 5.3 - Prob. 3EECh. 5.3 - Give a reason why the graph below Cannot be the...Ch. 5.3 - Prob. 1ESCh. 5.3 - Prob. 2ESCh. 5.3 - Prob. 3ESCh. 5.3 - Prob. 4ESCh. 5.3 - Prob. 5ESCh. 5.3 - Prob. 6ESCh. 5.3 - Prob. 7ESCh. 5.3 - Prob. 8ESCh. 5.3 - Prob. 9ESCh. 5.3 - Prob. 10ESCh. 5.3 - Prob. 11ESCh. 5.3 - Prob. 12ESCh. 5.3 - Show that the following graph contracts to K5.Ch. 5.3 - Show that the following graph contracts to the...Ch. 5.3 - Prob. 15ESCh. 5.3 - Prob. 16ESCh. 5.3 - Prob. 17ESCh. 5.3 - Count the number of vertices, edges, and faces,...Ch. 5.3 - Count the number of vertices, edges, and faces,...Ch. 5.3 - Count the number of vertices, edges, and faces,...Ch. 5.3 - Count the number of vertices, edges, and faces,...Ch. 5.3 - Count the number of vertices, edges, and faces,...Ch. 5.3 - Prob. 23ESCh. 5.3 - Prob. 24ESCh. 5.3 - Prob. 25ESCh. 5.3 - Prob. 26ESCh. 5.3 - Prob. 27ESCh. 5.3 - Prob. 28ESCh. 5.3 - Prob. 29ESCh. 5.3 - Prob. 30ESCh. 5.4 - A one-way road ends at a two-way street. The...Ch. 5.4 - A one-way road intersects a two-way road in a...Ch. 5.4 - A two-way road intersects another two-way road in...Ch. 5.4 - Prob. 1ESCh. 5.4 - Prob. 2ESCh. 5.4 - Prob. 3ESCh. 5.4 - Prob. 4ESCh. 5.4 - Prob. 5ESCh. 5.4 - Prob. 6ESCh. 5.4 - Prob. 7ESCh. 5.4 - Prob. 8ESCh. 5.4 - Prob. 9ESCh. 5.4 - Prob. 10ESCh. 5.4 - Prob. 11ESCh. 5.4 - Prob. 12ESCh. 5.4 - Prob. 13ESCh. 5.4 - Prob. 14ESCh. 5.4 - Prob. 15ESCh. 5.4 - Prob. 16ESCh. 5.4 - Prob. 17ESCh. 5.4 - Prob. 18ESCh. 5.4 - Prob. 19ESCh. 5.4 - Prob. 20ESCh. 5.4 - Prob. 21ESCh. 5.4 - Prob. 22ESCh. 5.4 - Scheduling Six different groups of children would...Ch. 5.4 - Scheduling Five different charity organizations...Ch. 5.4 - Scheduling Students in a film class have...Ch. 5.4 - Animal Housing A researcher has discovered six new...Ch. 5.4 - Prob. 27ESCh. 5.4 - Prob. 28ESCh. 5.4 - Prob. 29ESCh. 5.4 - Prob. 30ESCh. 5.4 - Scheduling Edge colorings, as explained in...Ch. 5 - (a) determine the number of edges in the graph,...Ch. 5 - (a) determine the number of edges in the graph,...Ch. 5 - Soccer In the table below, an X indicates teams...Ch. 5 - Each vertex in the graph at the left represents a...Ch. 5 - Determine whether the two graphs are equivalent.Ch. 5 - Determine whether the two graphs are equivalent.Ch. 5 - Find an Euler path if possible, and (b) find an...Ch. 5 - Find an Euler path if possible, and (b) find an...Ch. 5 - Find an Euler path if possible, and (b) find an...Ch. 5 - Prob. 10RECh. 5 - Prob. 11RECh. 5 - Architecture The floor plan of a sculpture gallery...Ch. 5 - Use Dirac's theorem to verify that the graph is...Ch. 5 - Use Dirac's theorem to verify that the graph is...Ch. 5 - Prob. 15RECh. 5 - Prob. 16RECh. 5 - Use the greedy algorithm to find a Hamiltonian...Ch. 5 - Use the greedy algorithm to find a Hamiltonian...Ch. 5 - Use the edge-picking algorithm to find a...Ch. 5 - Use the edge-picking algorithm to find a...Ch. 5 - Efficient Route The distances, in miles, between...Ch. 5 - Computer Networking A small office needs to...Ch. 5 - Prob. 23RECh. 5 - Prob. 24RECh. 5 - Prob. 25RECh. 5 - Prob. 26RECh. 5 - Count the number of vertices, edges, and faces in...Ch. 5 - Count the number of vertices, edges, and faces in...Ch. 5 - Prob. 29RECh. 5 - Prob. 30RECh. 5 - Prob. 31RECh. 5 - Prob. 32RECh. 5 - Prob. 33RECh. 5 - Prob. 34RECh. 5 - Scheduling A company has scheduled a retreat at a...Ch. 5 - Social Network Each vertex in the graph at the...Ch. 5 - Determine whether the following two graphs are...Ch. 5 - Answer the following questions for the graph shown...Ch. 5 - Recreation The illustration below depicts bridges...Ch. 5 - a. What does Dirac's theorem state? Explain how it...Ch. 5 - Low-Cost Route The table below shows the cost of...Ch. 5 - Use the greedy algorithm to find a Hamiltonian...Ch. 5 - Prob. 8TCh. 5 - Answer the following questions for the graph shown...Ch. 5 - Prob. 10TCh. 5 - Prob. 11TCh. 5 - A group of eight friends is planning a vacation in...
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Glencoe Algebra 1, Student Edition, 9780079039897...
Algebra
ISBN:9780079039897
Author:Carter
Publisher:McGraw Hill
Text book image
Big Ideas Math A Bridge To Success Algebra 1: Stu...
Algebra
ISBN:9781680331141
Author:HOUGHTON MIFFLIN HARCOURT
Publisher:Houghton Mifflin Harcourt