Q. For the given graph(G), which of the following statements is true? (Solved)
1. G is a complete graph
2. G is not a connected graph
3. The vertex connectivity of the graph is 2
4. none
- c. The vertex connectivity of the graph is 2
1. G is a complete graph
2. G is not a connected graph
3. The vertex connectivity of the graph is 2
4. none