Mathematics All Around - With MyMathLab and Workbook
Mathematics All Around - With MyMathLab and Workbook
6th Edition
ISBN: 9780134470313
Author: Pirnot
Publisher: PEARSON
bartleby

Videos

Textbook Question
Chapter 4.CT, Problem 1CT

Chapter 4.CT, Problem 1CT, Use the preceding graph to answer the following questions: a.How many edges does the graph have?

Use the preceding graph to answer the following questions:

a. How many edges does the graph have?

b. Which vertices are odd? Which are even?

c. Is the graph connected?

d. Does the graph have any bridges?

Expert Solution & Answer
Check Mark
To determine

To find:

a. Find the number of edges in the graph.

b. Find the odd vertices and even vertices.

c. Check whether the graph is connected or not.

d. Check whether the graph has any bridge or not.

Answer to Problem 1CT

Solution:

a. The number of edges in the graph is 9.

b. The odd vertices are E, F and the even vertices are A, B, C, D, G, H.

c. The given graph is a connected graph.

d. The graph has one bridge namely EF.

Explanation of Solution

Graph:

A graph is a set of points, called vertices, and lines, called edges, that join pairs of vertices.

Vertex:

1. The points in the graph are called as vertex.

2. The point of intersection of a pair of edges is not a vertex.

3. A vertex of a graph is odd if it is the endpoint of an odd number of edges.

4. A vertex is even if it is the endpoint of an even number of edges.

Degree:

1. Degree of a vertex is the number of edges joined to that vertex.

2. If the degree is an odd number, then it is called as odd vertex.

3. If the degree of a vertex is even, then the vertex is called as even vertex.

Edge:

The line joining a pair of vertices is called as edge.

For example, we can refer a line joining the vertices A and B as edge AB or edge BA.

Connected graph:

A graph is connected if it is possible to travel from any vertex to any other vertex of the graph by moving along successive edges.

Bridge:

A bridge in a connected graph is an edge such that if it were removed, the graph would no longer be connected.

Calculation:

The graph in the problem is given below.

Mathematics All Around - With MyMathLab and Workbook, Chapter 4.CT, Problem 1CT

a. Find the number of edges:

The vertices in the graph are A, B, C, D, E, F, G and H.

The line joining the vertices is AB, AC, CD, BE, ED, EF, FG, FH and GH.

The number of edges in the graph is 9.

b. Find the odd vertices and even vertices:

Vertex A is the endpoint of two edges, so its degree is two.

Vertex B is the endpoint of two edges, so its degree is two.

Vertex C is the endpoint of two edges, so its degree is two.

Vertex D is the endpoint of two edges, so its degree is two.

Vertex E is the endpoint of two edges, so its degree is three

Vertex F is the endpoint of two edges, so its degree is three.

Vertex G is the endpoint of two edges, so its degree is two.

Vertex H is the endpoint of two edges, so its degree is two.

The odd vertices are E, F and the even vertices are A, B, C, D, G, H.

c. Check whether the graph is connected or not:

In a connected graph, there are no unreachable vertices.

In the given graph, we can travel from one vertex to another through successive edges.

For example, we can travel from vertex A to F through edges AB, BE, EF.

The given graph is a connected graph.

d. Check whether the graph has any bridge or not:

In the graph, if we remove the edge EF, then the graph becomes non connected graph. We cannot travel from vertex A to vertex G.

The edge EF is a bridge in the graph.

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!

Chapter 4 Solutions

Mathematics All Around - With MyMathLab and Workbook

Ch. 4.1 - In Exercises 7-12, use Eulers theorem to decide...Ch. 4.1 - In Exercises 7-12, use Eulers theorem to decide...Ch. 4.1 - In Exercise 13-16, if the given graph is Eulerian,...Ch. 4.1 - In Exercise 13-16, if the given graph is Eulerian,...Ch. 4.1 - In Exercise 13-16, if the given graph is Eulerian,...Ch. 4.1 - In Exercise 13-16, if the given graph is Eulerian,...Ch. 4.1 - In Exercises 17-24, try to give an example of each...Ch. 4.1 - Prob. 18ECh. 4.1 - In Exercises 17-24, try to give an example of each...Ch. 4.1 - In Exercises 17-24, try to give an example of each...Ch. 4.1 - In Exercises 17-24, try to give an example of each...Ch. 4.1 - Prob. 22ECh. 4.1 - Prob. 23ECh. 4.1 - Prob. 24ECh. 4.1 - In Exercise 25-28, remove one edge to make the...Ch. 4.1 - Prob. 26ECh. 4.1 - Prob. 27ECh. 4.1 - In Exercise 25-28, remove one edge to make the...Ch. 4.1 - In Exercise 29-32, try to redraw the given graph...Ch. 4.1 - In Exercise 29-32, try to redraw the given graph...Ch. 4.1 - In Exercise 29-32, try to redraw the given graph...Ch. 4.1 - In Exercise 29-32, try to redraw the given graph...Ch. 4.1 - Finding an efficient route. A taxi driver wants to...Ch. 4.1 - Finding an efficient route. Repeat Exercises 33...Ch. 4.1 - Exercise 35 and 36 are similar to DUCK tour...Ch. 4.1 - Exercise 35 and 36 are similar to DUCK tour...Ch. 4.1 - Represent the maps given in Exercises 37-40 by...Ch. 4.1 - Represent the maps given in Exercises 37-40 by...Ch. 4.1 - Represent the maps given in Exercises 37-40 by...Ch. 4.1 - Represent the maps given in Exercises 37-40 by...Ch. 4.1 - Prob. 41ECh. 4.1 - Prob. 42ECh. 4.1 - Prob. 43ECh. 4.1 - Prob. 44ECh. 4.1 - Prob. 45ECh. 4.1 - Prob. 46ECh. 4.1 - Prob. 47ECh. 4.1 - In Exercises 4548, we give you a group of states....Ch. 4.1 - Finding an efficient route. Because of Michaels...Ch. 4.1 - Prob. 50ECh. 4.1 - Use the technique that we used in Example 7 to do...Ch. 4.1 - Use the technique that we used in Example 7 to do...Ch. 4.1 - Use the technique that we used in Example 7 to do...Ch. 4.1 - Use the technique that we used in Example 7 to do...Ch. 4.1 - If, in tracing a graph, we neither begin nor end...Ch. 4.1 - Examine a number of the graphs that we have drawn...Ch. 4.1 - Can an Eulerian graph have a bridge? In order to...Ch. 4.1 - Consider any graph that has some odd and also some...Ch. 4.1 - Discuss specific examples of ways that...Ch. 4.1 - Prob. 60ECh. 4.1 - Draw a graph that can be colored with only two...Ch. 4.1 - Draw a graph that cannot be colored with two...Ch. 4.1 - Draw a graph that cannot be colored with three...Ch. 4.1 - Can you state what configuration of vertices will...Ch. 4.1 - Different notes on a trumpet are obtained by...Ch. 4.1 - If an instrument has four valves, there are 16...Ch. 4.1 - Assume that the registrar at your school is...Ch. 4.1 - Make up a scheduling problem that would be of some...Ch. 4.2 - Prob. 1ECh. 4.2 - Prob. 2ECh. 4.2 - Prob. 3ECh. 4.2 - Prob. 4ECh. 4.2 - Prob. 5ECh. 4.2 - Prob. 6ECh. 4.2 - Prob. 7ECh. 4.2 - Prob. 8ECh. 4.2 - How many Hamilton circuits are in K7?Ch. 4.2 - How many Hamilton circuits are in K8?Ch. 4.2 - Prob. 11ECh. 4.2 - Prob. 12ECh. 4.2 - Prob. 13ECh. 4.2 - Prob. 14ECh. 4.2 - Prob. 15ECh. 4.2 - Prob. 16ECh. 4.2 - Prob. 17ECh. 4.2 - Prob. 18ECh. 4.2 - Prob. 19ECh. 4.2 - Prob. 20ECh. 4.2 - Prob. 21ECh. 4.2 - Prob. 22ECh. 4.2 - Prob. 23ECh. 4.2 - Prob. 24ECh. 4.2 - In Exercises 23 -28, use the best edge algorithm...Ch. 4.2 - Prob. 26ECh. 4.2 - In Exercise 23 -28, use the best edge algorithm to...Ch. 4.2 - In Exercise 23 -28, use the best edge algorithm to...Ch. 4.2 - Simon Cowell plans a series of live shows from...Ch. 4.2 - ESPN is planning to do a special series called...Ch. 4.2 - Foodandwine.com states that the best ice cream...Ch. 4.2 - In order to try to solve a European financial...Ch. 4.2 - Prob. 33ECh. 4.2 - Prob. 34ECh. 4.2 - Prob. 35ECh. 4.2 - Prob. 36ECh. 4.2 - Prob. 37ECh. 4.2 - Prob. 38ECh. 4.2 - Prob. 39ECh. 4.2 - Prob. 40ECh. 4.2 - Prob. 41ECh. 4.2 - Prob. 42ECh. 4.2 - Prob. 43ECh. 4.2 - Prob. 44.1ECh. 4.2 - Prob. 44.2ECh. 4.2 - Prob. 45.1ECh. 4.2 - Prob. 45.2ECh. 4.2 - Prob. 45.3ECh. 4.2 - Prob. 49ECh. 4.2 - Prob. 51ECh. 4.2 - Prob. 52ECh. 4.3 - In Exercises 1-4, use each graph to find the...Ch. 4.3 - In Exercises 1-4, use each graph to find the...Ch. 4.3 - In Exercises 1-4, use each graph to find the...Ch. 4.3 - In Exercises 1-4, use each graph to find the...Ch. 4.3 - Prob. 5ECh. 4.3 - Prob. 6ECh. 4.3 - Prob. 7ECh. 4.3 - Prob. 8ECh. 4.3 - Modeling the spread of rumours. Ryan, Dwight, Pam,...Ch. 4.3 - Modeling the spread of classified information....Ch. 4.3 - Modeling the flow of paperwork through a...Ch. 4.3 - Modeling the spread of disease. The following...Ch. 4.3 - Prob. 13ECh. 4.3 - Modeling a communication network. An AMBER alert...Ch. 4.3 - Ranking football teams. The given graph shows the...Ch. 4.3 - Ranking American Gladiators. The graph below shows...Ch. 4.3 - Modeling influence. A designer who wishes to...Ch. 4.3 - Prob. 18ECh. 4.3 - Prob. 19ECh. 4.3 - Ranking CrossFit competitors. CrossFit is a...Ch. 4.3 - Prob. 21ECh. 4.3 - Prob. 22ECh. 4.3 - Prob. 23ECh. 4.3 - Prob. 24ECh. 4.3 - Prob. 25ECh. 4.3 - Prob. 26ECh. 4.3 - Prob. 27ECh. 4.3 - Prob. 28ECh. 4.3 - Prob. 29ECh. 4.3 - Communicating Mathematics In the incidence...Ch. 4.3 - Math in Your Life: Between the Numbers The history...Ch. 4.3 - Prob. 32ECh. 4.3 - Prob. 33ECh. 4.3 - Prob. 34ECh. 4.4 - Sharpening Your Skills. In Exercises 1 4, assume...Ch. 4.4 - Sharpening Your Skills. In Exercises 1 4, assume...Ch. 4.4 - Sharpening Your Skills. In Exercises 1 4, assume...Ch. 4.4 - Sharpening Your Skills. In Exercises 1 4, assume...Ch. 4.4 - Sharpening Your Skills. In Exercises 5 8, use the...Ch. 4.4 - Sharpening Your Skills. In Exercises 5 8, use the...Ch. 4.4 - Sharpening Your Skills. In Exercises 5 8, use the...Ch. 4.4 - Sharpening Your Skills. In Exercises 5 8, use the...Ch. 4.4 - Applying What Youve Learned. Planning a festival....Ch. 4.4 - Applying What Youve Learned. Organizing a project....Ch. 4.4 - Applying What Youve Learned. Building a student...Ch. 4.4 - Applying What Youve Learned. Organizing a health...Ch. 4.4 - Applying What Youve Learned. Organizing an...Ch. 4.4 - Communicating Mathematics. Study Figure 4.35 with...Ch. 4.4 - Communicating Mathematics. Write a brief report on...Ch. 4.4 - Challenge yourself. Planning an innovative house....Ch. 4.CR - Section 4.1 Use the preceding graph to answer the...Ch. 4.CR - Section 4.1 Explain how graphs are used to model a...Ch. 4.CR - Section 4.1 Which of the following graphs can be...Ch. 4.CR - Section 4.1 Use Fleurys algorithm to find an Euler...Ch. 4.CR - Section 4.1 Model the following street map with a...Ch. 4.CR - Prob. 6CRCh. 4.CR - Section 4.1 Allison, Branden, Colin, Donny, Erica,...Ch. 4.CR - Section 4.2 Find all Hamilton circuits that begin...Ch. 4.CR - Section 4.2 Use the following weighted graph to...Ch. 4.CR - Section 4.2 Use the following weighted graph to...Ch. 4.CR - Prob. 11CRCh. 4.CR - Prob. 12CRCh. 4.CR - Section 4.3 When are directed graphs rather than...Ch. 4.CR - Section 4.3 A student action committee has been...Ch. 4.CR - Section 4.4 Use the following PERT diagram to...Ch. 4.CR - Section 4.4 Congratulations You are planning your...Ch. 4.CT - Use the preceding graph to answer the following...Ch. 4.CT - Which of the following graphs can be traced? If a...Ch. 4.CT - Use Fleurys algorithm to find an Euler circuit in...Ch. 4.CT - Find all Hamilton circuits that begin at vertex A...Ch. 4.CT - Model the following street map with a graph and...Ch. 4.CT - Prob. 6CTCh. 4.CT - Use the following weighted graph to answer...Ch. 4.CT - Use the following weighted graph to answer...Ch. 4.CT - Use the following weighted graph to answer...Ch. 4.CT - Use the given directed graph to find the following...Ch. 4.CT - Use the given PERT diagram to answer the following...Ch. 4.CT - The following graph models one- and two-stage...
Knowledge Booster
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.
Recommended textbooks for you
  • 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
    Calculus Volume 1
    Math
    ISBN:9781938168024
    Author:Strang, Gilbert
    Publisher:OpenStax College
  • 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
  • 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
    Calculus Volume 1
    Math
    ISBN:9781938168024
    Author:Strang, Gilbert
    Publisher:OpenStax College
    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