Q50

MCQ2 marks, −0.67

In a connected graph, a bridge is an edge whose removal disconnects the graph. Which one of the following statements is true?

(A)

A tree has no bridges

(B)

A bridge cannot be part of a simple cycle

(C)

Every edge of a clique with size $\geq 3$ is a bridge (A clique is any complete subgraph of a graph)

(D)

A graph with bridges cannot have cycle

Loading…