GATE | GATE-CS-2015 (Set 2) | Question 65
In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is True?
A tree has no bridge
A bridge cannot be part of a simple cycle
Every edge of a clique with size ≥ 3 is a bridge (A clique is any complete subgraph of a graph)
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
Share your thoughts in the comments
Please Login to comment...