GATE Computer Science (CS) 2015 Shift 2 Solved Paper

© examsiri.com

Question : 62 of 65

Marks: +1, -0

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 bridges
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 sub graph of a graph)
A graph with bridges cannot have a cycle

Go to Question:

Prev Question

Next Question