• recategorized by
3,808 views

1 Answer

Best answer
0 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:
Position:
Show:

Related questions

0 0 votes
0 0 answers
3.4k
3.4k views
syncronizing asked Sep 15, 2018
3,412 views
Consider the following graph:The number of strongly connected components of the graph are ________.
2 2 votes
0 0 answers
3.7k
3.7k views
Na462 asked Nov 14, 2018
3,709 views
2 2 votes
0 0 answers
900
900 views
2 2 votes
0 0 answers
593
593 views