1.

For the given graph(G), which of the following statements is true?(a) G is a complete graph(b) G is not a connected graph(c) The vertex connectivity of the graph is 2(d) The edge connectivity of the graph is 1My query is from Graph topic in chapter Graph of Data Structures & Algorithms IThis question was addressed to me in my homework.

Answer»

Right CHOICE is (c) The VERTEX connectivity of the GRAPH is 2

To EXPLAIN: After removing vertices B and C, the graph becomes disconnected.



Discussion

No Comment Found

Related InterviewSolutions