GATE CS 2015 Set 2 — Question 17

Multiple choice 1 mark Question 17 2015

Question 17

MCQ 1 marks · −0.33 Discrete Mathematics

In a connected graph, a bridge is an edge whose removal disconnects the 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 \(\geq 3\) is a bridge D A graph with bridges cannot have a cycle

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2015 Discrete Mathematics

Source: GATE 2015 Computer Science and Information Technology, Set 2 (set and question number approximate)

GATE CS 2014 Set 3 — Question 51
GATE CS 2016 Set 1 — Question 49
GATE CS 2016 Set 2 — Question 40
GATE CS 2017 Set 1 — Question 48
GATE CS 2009 — Question 12
GATE CS 2014 Set 1 — Question 20
GATE CS 2014 Set 3 — Question 13
GATE CS 2015 Set 2 — Question 25

All Discrete Mathematics questions

The answer and the full explanation are one sign-in away

Where this question comes from

More questions from Discrete Mathematics