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.