2. Computer Science Engineering (CSE)
  3. Data Structures (DS)
  4. Non Linear Data Structures - Graphs
  5. For the given graph(G), which of the fol...
Q.

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. none
Answer» C. The vertex connectivity of the graph is 2
View all MCQs in:   Data Structures (DS)

Discussion