Thinking Mathematically (6th Edition)

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

Chapter 14 - Graph Theory - Chapter 14 Test - Page 938: 4


The edge CF is a bridge.

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. If we choose any two vertices in the graph given in this exercise, there is a path which has these two vertices as endpoints. Therefore, this graph is connected. Let's remove the edge CF. Let's consider the vertices F and B. If the edge CF is removed, then there is no path in the graph which has vertex F and vertex B as endpoints. Then the graph is not connected. Removing the edge CF makes the graph disconnected. Therefore, the edge CF is a bridge. No other edges in the graph are bridges, because even if we remove one of those edges, the graph will still be connected.
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.