HEART OF MATHEMATICS
4th Edition
ISBN: 9781119760061
Author: Burger
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Question
Chapter 6.2, Problem 17MS
To determine
To check: whether it is possible to draw a connected graph in the plane with an odd number of regions, an odd number of vertices and an even number of edges or not, if possible draw the graph, if not explain the reason for that and also compare the response with the previous mindscape.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
In Flatland there are four cities, Abbott, Banchoff, Charlie and Dimension. The distance from The distance from Abbott to Banchoff is 9 miles. The distance from Abbott to Charlie is 8 miles. The
distance from Abbott to Dimension is 11 miles. The distance from Banchoff to Charlie is 15 miles. The distance from Banchoff to Dimension is 13 miles. The distance from Charlie to Dimension is
12 miles. Sketch a graph to represent the traveling salesman problem for this situation, and find the length of the shortest path. Remember to begin and end in the same city. The shortest path is
miles.
Graph theory can be used to help solve many real world problems. For example, we can use graph colorings to help us
solve situations like the one described below.
There are 10 people enrolled in the Extended Learning classes as part of a summer study abroad program. They are taking
the classes as shown in the table.
Darnal
Elsie
Mica
Kiana
Beatrix
Ignacio Literature, Psychology, Game Design
Hans
Religion, Ethics
Ethics, History, Literature
Ethics, Game Design
Psychology, Religion
Religion, Psychology
History, Religion
Landry Literature, Sociology, Religion
Jamie
Literature, Ethics
Callie Psychology, Game Design, Literature
The host university needs to schedule final exams for these students and would like to use the minimum number of time
slots required. We can use graph theory to help us analyze this situation.
We begin by making a graph using the data in the table. Draw the following graph on a piece of paper. In our graph, each
vertex represents one of the classes. Two vertices are…
The floor plan of the art gallery is pictured below. Draw a graph that represents the
floor plan, where vertices correspond to rooms and edges correspond to doorways.
Is it possible to take a stroll that passes through every doorway without going
through the same doorway twice?
If so, does it matter whether we return to the starting point?
Chapter 6 Solutions
HEART OF MATHEMATICS
Ch. 6.1 - Map maker, map maker make me a graph. Represent...Ch. 6.1 - Unabridged list. Represent cach landmass from...Ch. 6.1 - Will the walk work? Does your graph from...Ch. 6.1 - Walk around the house. Is it possibel to traverse...Ch. 6.1 - Walk the line. Does this graph above have an Euler...Ch. 6.1 - Walkabout. Does this graph have an Euler circuit?...Ch. 6.1 - Linking the loops. In this map, the following...Ch. 6.1 - Scenic drive. (S) Here is a map of Rockystone...Ch. 6.1 - Under-edged. (H) Does this graph have an Euler...Ch. 6.1 - No man is an island. The country of Pelago...
Ch. 6.1 - Path-o-rama. For each graph below, determine if...Ch. 6.1 - Walk around the block. Create a graph of the...Ch. 6.1 - Walking the dogs. Your dogs, Abbey and Bear, love...Ch. 6.1 - Delivery query. The next time you see a postal...Ch. 6.1 - Snow job. (ExH) Shown here is a map of the tiny...Ch. 6.1 - Special delivery. (ExH) Julia is the letter...Ch. 6.1 - Draw this old house. Suppose you wanted to trace...Ch. 6.1 - Path of no return. Consider this map showing a...Ch. 6.1 - Without a trace. Is it possibel to trace out...Ch. 6.1 - New Euler. In the three previous Mindscapes, you...Ch. 6.1 - New edge—new circuit. Look at the graph for...Ch. 6.1 - New edge—new path. Review your work for...Ch. 6.1 - Path to proof. Suppose you have a connected graph...Ch. 6.1 - No Euler no how. Look at graph (a) for Mindscape...Ch. 6.1 - Degree day. (S) For cach graph below, determine...Ch. 6.1 - degrees of proof. Review your work for Mindscape...Ch. 6.1 - Degrees in sequence. Can you draw a graph that has...Ch. 6.1 - Even Steven. Review your work in Mindscape 28 to...Ch. 6.1 - Little League lesson. (H) You are in charge of...Ch. 6.1 - With a group of folks. In a small group, discuss...Ch. 6.1 - Power beyond the mathematics. Provide several...Ch. 6.1 - Here we celebrate the power of algebra as a...Ch. 6.1 - Here we celebrate the power of algebra as a...Ch. 6.1 - Here we celebrate the power of algebra as a...Ch. 6.1 - Here we celebrate the power of algebra as a...Ch. 6.1 - Here we celebrate the power of algebra as a...Ch. 6.2 - What a character! What expression gives the Euler...Ch. 6.2 - Count, then verify. What are the values of V, E,...Ch. 6.2 - Sneeze, then verify. Look at an unopened tissue...Ch. 6.2 - Blow, then verify. Inflate a ballon and use a...Ch. 6.2 - Add one. Find the values V, E, and F for the graph...Ch. 6.2 - Bowling. What is the Euler Characteristic of the...Ch. 6.2 - Making change. We begin with the graph pictured at...Ch. 6.2 - Making a point. Take a connected graph and add a...Ch. 6.2 - On the edge (H). Is it possible to add an edge to...Ch. 6.2 - Soap films. Consider the following sequence of...Ch. 6.2 - Dualing. What is the relationship between the...Ch. 6.2 - Prob. 12MSCh. 6.2 - Lots of separation. Suppose we are told that a...Ch. 6.2 - Prob. 14MSCh. 6.2 - Psychic readings. Someone is thinking of a...Ch. 6.2 - Prob. 16MSCh. 6.2 - Prob. 17MSCh. 6.2 - Circular reasoning. Create a connected graph as...Ch. 6.2 - Prob. 19MSCh. 6.2 - More circles. Consider the sphere described in...Ch. 6.2 - In the rough (S). Count the number of facets,...Ch. 6.2 - Cutting corners (H). The following collection of...Ch. 6.2 - Stellar. The following collection of pictures...Ch. 6.2 - A torus graph (ExH). The Euler Characteristic...Ch. 6.2 - Regular unfolding. Each graph below represents...Ch. 6.2 - A tale of two graphs. Suppose we draw a graph that...Ch. 6.2 - Two graph conjectures (S). Can you conjecture a...Ch. 6.2 - Lots of graphs conjecture. Can you conjecture a...Ch. 6.2 - Torus count. Three hollowed, triangular prisms...Ch. 6.2 - Torus two count (H). Carefully count the number of...Ch. 6.2 - Torus many count. Using the preceding calculations...Ch. 6.2 - Prob. 32MSCh. 6.2 - Tell the truth. Someone said that she made a...Ch. 6.2 - No sphere. Suppose we have a sphere built out of...Ch. 6.2 - Soccer ball. A soccer ball is made of pentagons...Ch. 6.2 - Klein bottle. Using the diagram here for building...Ch. 6.2 - Not many neighbors. Show that every map has at...Ch. 6.2 - Infinite edges. Suppose we consider a conn ected...Ch. 6.2 - Here we celebrate the power of algebra as a...Ch. 6.2 - Prob. 44MSCh. 6.2 - Prob. 45MSCh. 6.2 - Here we celebrate the power of algebra as a...Ch. 6.2 - Here we celebrate the power of algebra as a...Ch. 6.3 - Dont be cross. Here is a drawing of a graph with...Ch. 6.3 - De Plane! De Plane! (S) Is the graph given in...Ch. 6.3 - Countdown (H). For the graph drawing shown, count...Ch. 6.3 - Prob. 4MSCh. 6.3 - Criss-Cross. Is it possible to redraw the graph...Ch. 6.3 - Dont cross in the edge. Each of the graphs drawn...Ch. 6.3 - Hot crossed buns. Each of the graphs drawn below...Ch. 6.3 - Prob. 8MSCh. 6.3 - Spider on a mirror. Is it possible to redraw the...Ch. 6.3 - One more vertex. The graph here is drawn to show...Ch. 6.3 - Yet one more vertex (H). The graph shown is drawn...Ch. 6.3 - Familiar freckles. Is it possible to redraw the...Ch. 6.3 - Remind you of anyone you know? Is it possible to...Ch. 6.3 - Final countdown. For this graph drawing, count the...Ch. 6.3 - Euler check-up. Use your answer to the previous...Ch. 6.3 - Euler second opinion. For the graph drawing shown...Ch. 6.3 - Prob. 17MSCh. 6.3 - Prob. 18MSCh. 6.3 - A colorful museum. This figure shows the floor...Ch. 6.3 - Limit of 5. Start drawing a planar graph. Keep...Ch. 6.3 - Starring the hexagon. Is it possible to redraw...Ch. 6.3 - Prob. 22MSCh. 6.3 - Prob. 23MSCh. 6.3 - Getting greedy. (H) Suppose you are asked to color...Ch. 6.3 - Stingy rather than greedy. By coloring the...Ch. 6.3 - Getting more colorful. Graphs dont have to be...Ch. 6.3 - Prob. 27MSCh. 6.3 - Prob. 28MSCh. 6.3 - Chromatically applied. There are eight radio...Ch. 6.3 - Prob. 30MSCh. 6.3 - Personal perspectives. Write a short essay...Ch. 6.3 - Here we celebrate the power of algebra as a...Ch. 6.3 - Here we celebrate the power of algebra as a...Ch. 6.3 - Prob. 37MSCh. 6.3 - Here we celebrate the power of algebra as a...Ch. 6.3 - Here we celebrate the power of algebra as a...Ch. 6.4 - Up close and personal. Create a graph to model...Ch. 6.4 - Network lookout. Find an examle of a network...Ch. 6.4 - Prob. 3MSCh. 6.4 - Hamiltonian holiday (S). You are interning for a...Ch. 6.4 - Home style. Create a graph to model the rooms in...Ch. 6.4 - Six degrees or less. Suppose this graph is a model...Ch. 6.4 - Degrees of you. Find ten willing friends or...Ch. 6.4 - Campus shortcut. Find a map of your campus and...Ch. 6.4 - Arborist lesson. Which of the graphs below are...Ch. 6.4 - Prob. 10MSCh. 6.4 - Prob. 11MSCh. 6.4 - Prob. 12MSCh. 6.4 - Prob. 13MSCh. 6.4 - Prob. 14MSCh. 6.4 - Prob. 15MSCh. 6.4 - Hamilton Study. Look at the graph you drew to...Ch. 6.4 - Business trip redux. Look back in the section and...Ch. 6.4 - Handling Hamiltons. For each graph below, find a...Ch. 6.4 - Road trip. You are checking out gradua te programs...Ch. 6.4 - Back to Hatties trip. Look back in this section...Ch. 6.4 - Solve the Icosian Game. Find a Hamiltonian circuit...Ch. 6.4 - Hunt for Hamilton (S). A large island country has...Ch. 6.4 - Has no Hamilton. Give some characteristics that...Ch. 6.4 - Cubing Hamilton (ExH). Can you find a Hamihonian...Ch. 6.4 - Hamiltonian path. A Hamiltonian path is a path in...Ch. 6.4 - Sorry, no path. Give some characteristics that...Ch. 6.4 - Prob. 27MSCh. 6.4 - Prob. 28MSCh. 6.4 - Prob. 29MSCh. 6.4 - Prob. 30MSCh. 6.4 - Edge count. Look at all the trees you drew in the...Ch. 6.4 - Personal perspecthes. Write a short essay...Ch. 6.4 - Prob. 33MSCh. 6.4 - Prob. 34MSCh. 6.4 - Dollars and cents. Your spanning tree has three...Ch. 6.4 - Adding up. Your spanning tree has four edges with...Ch. 6.4 - Prob. 38MSCh. 6.4 - Vertex search (H). Your graph has a Hamiltonian...Ch. 6.4 - Binary gossip tree. You told a secret to two of...
Knowledge Booster
Similar questions
- Socaccio Pistachio, Inc. makes two types of pistachio nuts: Dazzling Red and Organic. Pistachio nuts require food color and salt, and the following table shows the amount of food color and salt required fo a 1-kilogram batch of pistachios as well as the total amount of these ingridients available each day: Use a graph to show the possible numbers of batches of each type of pistachio Socaccio can produce each day. Dazzling Red Organic Total Available Food color(grams) 2 1 20 Salt(grams) 10 20 220arrow_forwardWhere is the number of stores in that graph?arrow_forwardQ10D. Consider the graph with the following vertices and edges: V = {a, b, c, d, e, f, g} E = {{a, b}, {a, c}, {a, d}, {a, f}, {b, c}, {b, e}, {b, f}, {c, d}, {c, g}, {d, e}, {d, f}, {f, g}} Which of the following are examples of circuits within the graph? (Select all that apply.) Question 10 options: < e, d, f, g, c > < b, c, a, b > < a, b, c, g, f, d > < a, c, f, a > < b, f, d, a, b >arrow_forward
- The first floor plan of a commercial building is shown at the right. Draw a graph (with complete label) that represents the floor plan, where each vertex represents a room/location and an edge connects two vertices if there is a doorway between the two rooms/locations. Then answer the following questions: Room A Room E Room D Room B Room Carrow_forwardAarrow_forwardCan you give me a detailed answer and a graph for this question?arrow_forward
- Find the connected components of the graph: G = (V, E). V = {a, b, c, d, e, f, g, h, i, j}. E = {{f.h}, {e,d}, {c,b}, {i.j}, {a,b}, {i.f}. {f.j} }arrow_forward. Sketch the complete graph with number of vertex 6.arrow_forwardWe begin by making a graph using the data in the table. Draw the following graph on a piece of paper. In our graph, each vertex represents one of the classes. Two vertices are connected if there is a student taking both of those classes. Note that if a student is taking both of those classes, then those final exams cannot occur at the same time. D E C G F A Use the graph you drew to determine what is the minimum number of final exam times slots needed so that the people can take all of their final exams. (Hint: Would a vertex coloring or an edge coloring be more useful here?) In the following table, indicate in which final exam time slot each class could be placed (i.e. 1,2, etc). Religion French Astronomy Ethics History Underwater Basket Weaving Journalismarrow_forward
- Q29. If we need a lot of adding and removing edges to a graph, it is better to represent the graph as .......... Adjacency matrix Adjacency listarrow_forwardneed help with a and barrow_forwardQ14C. Consider the graph with the following vertices and edges: V = {a, b, c, d, e, f, g} E = {{a, b}, {a, c}, {a, d}, {a, f}, {b, c)}, {b, e}, {b, f}, {c, d}, {c, g}, {d, e}, {d, f}, {f, g}} b a d e (1) g Which of the following sets of edges represent subgraphs of the graph that are trees? (Select all that apply.) {{a, b}, {a, c}, {a, d}} {[a, b}, {a, c}, {a, f}, {b, f}, {d, e}, {f, g}} |{{a, c}, {a, f}, {b, e}, {b, f}, {d, f}, {f, g}} {{a, b}, {b, c}, {a, f}, {c, d}, {d, e}, {f, g}} {{a, c}, {a, f}, {b, c}, {c, d}, {c, g}, {d, e}}arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:CengageCollege Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:9781133382119
Author:Swokowski
Publisher:Cengage
College Algebra (MindTap Course List)
Algebra
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:Cengage Learning