Thinking Mathematically (6th Edition)

Published by Pearson
ISBN 10: 0321867327
ISBN 13: 978-0-32186-732-2

Chapter 14 - Graph Theory - Chapter Summary, Review, and Test - Review Exercises - Page 935: 9


AD, DE, and DF are bridges.

Work Step by Step

For any two vertices in a graph, if there is at least one path which has these two vertices as endpoints, then the graph is connected. If removing an edge makes the graph disconnected, then that edge is called a bridge. The graph in this question is connected. If we remove edge AB, edge BC, or edge AC, the graph is still connected. Therefore, these three edges are not bridges. However, if we remove edge AD, edge DE, or edge DF, the graph will not be connected. Therefore, these three edges are bridges. AD, DE, and DF are bridges.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.