An edge e of a connected graph is called a bridge when e is removedfrom the edge set
Chapter 3, Problem 13(choose chapter or problem)
An edge e of a connected graph is called a bridge when e is removedfrom the edge set, the resulting subgraph is disconnected. For example, theedges in the graph below that are bridges are ab, bc, and fg. Give an exampleof a connected graph of order 7(a) with no bridges. (b) with one bridge. (c) with 6 bridges.
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