Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE | GATE-CS-2015 (Set 2) | Question 65

  • Difficulty Level : Basic
  • Last Updated : 28 Jun, 2021

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

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

(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

Answer: (B)

Explanation: A bridge in a graph cannot be a part of cycle as removing it will not create a disconnected graph if there is a cycle.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :