gate forum test series

Question

2 vertices connected by an edge is a complete graph (G) and for complete graph (Kn) vertex connectivity is (n-1), so for this G connectivity is 1, now will it be considered as a biconnected component of the given graph or not, if yes then why? 

Answer 1

Yes, 6 is the correct answer!
A bi-connected graph is a graph which contains no articulation point (or) A bi-connected graph is a graph in which if a vertex is removed then still a graph remain connected.

In this bi-connected components are asked, so, following are the $6$ bi-connected components:
1. A-B
2. G-J
3. I-G
4. E-F
5. C-B-E-D
6. F-G-H

Regarding your question, yes K2 should be a bi-connected graph, as single vertex is considered as a connected component.

Comments

@Manu Thakur K2 should be 1 connected according to the definition (https://en.wikipedia.org/wiki/K-vertex-connected_graph)