+1 vote
in Data Structures & Algorithms I by (88.2k points)
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 1

My query is from Graph topic in chapter Graph of Data Structures & Algorithms I

This question was addressed to me in my homework.

1 Answer

+1 vote
by (672k points)
selected by
 
Best 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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...