In a connected graph, a bridge is an edge whose removal disconnects the graph. Which one of the following statements is true?
Reason why D is not the answer
In a tree every edge is a BRIDGE
Bridge / cut edge : A single edge whose removal will disconnect the graph is known as Bridge or cut edge.
Correct Answer: $B$
A clique, C, in an undirected graph G = (V, E) is a subset of the vertices, C ⊆ V, such that every two distinct vertices are adjacent. This is equivalent to the condition that the induced subgraph of G induced by C is a complete graph. In some cases, the term clique may also refer to the subgraph directly.
So it cant be disconnect the graph
This might help ....
This one ....
Bridge / cut edge :A single edge whose removal will disconnect the graph is known as Bridge or cut edge .
Cut set: It is a set of edges whose removal makes the graph disconnected.
The option (c) is wrong because they are asking for Bridge not cut set .Don't confuse with the definition.
Leaves of the tree are not the cut vertex.
@Hemant ,Yes u r right.
@Warrior 1st statement should be like this:- In a tree, every edge is cut edge and every vertex need not be a cut vertex.