An edge whose removal disconnects the graph of which it is a part is called a bridge
Chapter 10, Problem 6(choose chapter or problem)
An edge whose removal disconnects the graph of which it is a part is called a bridge. Find all bridges for each of the following graphs.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer