Gate CS-2015-2 Question Paper With Solutions

Q. 36 In a connected graph, a bridge is an edge whose removal disconnects a 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 $ 3 is a bridge (A clique is any compete sub
graph of a graph)

(D) A graph with bridges cannot have a cycle

Answer: (B)

Explanation:

Gate CS-2015-2 Question Paper With Solutions

Learn More:   Gate ME-2016-1 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here