Thinking Mathematically (6th Edition)

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

Chapter 14 - Graph Theory - 14.1 Graphs, Paths, and Circuits - Exercise Set 14.1: 70

Answer

This graph has six vertices and two bridges. The edge BE and the edge DF are bridges.
1514392141

Work Step by Step

In a connected graph, for any pair of vertices, there is at least one path with these two vertices as the endpoints of the path. If removing an edge makes the graph disconnected, then that edge is called a bridge. This graph is a connected graph. However, if we remove the edge BE or the edge DF, the graph will be disconnected. The edge BE is a bridge and the edge DF is a bridge. However, no other edge is a bridge, since we can remove any other edge without making the graph disconnected. This graph has six vertices and two bridges. The edge BE and the edge DF are bridges.
Small 1514392141
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.