recategorized by
2,425 views

1 Answer

Best answer
0 votes
0 votes

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. 1-2
  2. 1-2-3-6-4-5-7
  3. 7-8-9
  4. 7-10-11-12-13
  5. 8-9
  6. 10-11

There are 6 Bi-connected components , which is option D .

Answer:

Related questions

0 votes
0 votes
0 answers
1
syncronizing asked Sep 15, 2018
2,451 views
Consider the following graph:The number of strongly connected components of the graph are ________.
2 votes
2 votes
0 answers
2
2 votes
2 votes
0 answers
3
3 votes
3 votes
0 answers
4
smsubham asked Jan 6, 2018
519 views
Am getting 7. The answer given is 10.A - B , A - D , D - E , E - C are the edges i have included.