A biconnected component is a maximal biconnected subgraph .
Here in this given graph, we first use Hopcroft -Tarjan algorithm to find articulation points .
In the given graph , We get Vertices 1, 7 , 8, and 10 are Articulation Points .
So, Bi-connected components are :
- 1-2
- 1-2-3-6-4-5-7
- 7-8-9
- 7-10-11-12-13
- 8-9
- 10-11
There are 6 Bi-connected components , which is option D .