In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is True?
(A) A tree has no bridge
(B) A bridge cannot be part of a simple cycle
(C) Every edge of a clique with size ≥ 3 is a bridge (A clique is any complete subgraph of a graph)
(D) A graph with bridges cannot have a cycle
Answer: (B)
Explanation: A bridge in a graph cannot be a part of cycle as removing it will not create a disconnected graph if there is a cycle.
Quiz of this Question