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

Question

Examsnet · Accepted Answer

Correct Answer is : A bridge cannot be part of a simple cycle

GATE Computer Science (CS) 2015 Shift 2 Solved Paper