Articulation point of graph / Biconnected components and DFS traversal


In the connected graph G, a vertex V is said to be an articulation point if and only if the deletion of vertex V disconnects the graph into two or more non - empty components. For more precisely satisfy this concept, consider the following connected graph
 
In this graph, basically vertex 2 is an articulation point, as if we delete the vertex, it will disconnects the graph into two non - empty component.
 

As shown in the fig, it would be disconnected the graph into two parts as shown in fig (b). thus we cannot say that, the above graph is bi-connected graph. Again for simplicity consider the following graph
The above graph (c) would be considered as bi-connected graph, as we deleted any vertex it can not be form another part of graph. By the above description, we can surely say that in connected graph G, every bi-connected component contains at least two vertices. Now for identifying the articulation point and the bi-connected components, DFS techniques of graph can be very useful. Consider the following graph and weights on it. Lets apply the DFS technique, mainly DFS technique is using the stack.
 
Apply DFS on above graph, then the graph would be as follows 
 

Comments

Post a Comment

Popular posts from this blog

Brief shortnote on Requirement elicitation and requirement analysis

Requirement Engineering