1.

A bridge can not be a part of _______(a) a simple cycle(b) a tree(c) a clique with size ≥ 3 whose every edge is a bridge(d) a graph which contains cyclesThe question was asked by my college professor while I was bunking the class.This interesting question is from Complete and Connected Graphs topic in section Graphs of Discrete Mathematics

Answer»

Right option is (a) a simple cycle

To EXPLAIN I would say: In a CONNECTED graph, a bridge is an edge WHOSE REMOVAL disconnects the graph. In a cycle if we remove an edge, it will still be connected. So, bridge cannot be PART of a cycle. A clique is any complete subgraph of a graph.



Discussion

No Comment Found

Related InterviewSolutions