Planning to take coaching on Unacademy
http://bit.ly/gate_unacademy
or
https://unacademy.com/
here is a code for 10% off PLUS1BPK1
Telegram Notification Group link:-
https://t.me/joinchat/X5egW_cvdt9kMGY1
Telegram discussion Group link:-
https://t.me/joinchat/VCyGUmVq8RNkMzhl
Downloads resources from here
https://education4fun.com/gate-cse/
MCQ (Single Correct Answer)
GATE CSE 2015 Set 2
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 bridge
(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 complete subgraph of a graph)(D) A graph with bridges cannot have a cycle
