retagged by
2,022 views
6 votes
6 votes

retagged by

2 Answers

Best answer
2 votes
2 votes

A vertex in an undirected connected graph is an articulation point (or cut vertex) iff removing it (and edges through it) disconnects the graph.

Refer these images they might help in finding articulation point 

Now coming to problem given by you Yes your graph is having 3 articulation (cut vertex) point NODE 3, NODE 2 AND NODE 5

selected by
0 votes
0 votes

Articulation points are the vertex cut i.e the vertices whose removal will simply disconnect the graph. Here there are 3 such nodes. 

Related questions

0 votes
0 votes
1 answer
1
Lakshman Bhaiya asked Oct 21, 2018
412 views
How many numbers of Articulation Points (Cut Vertices) in a Graph are possible?
3 votes
3 votes
2 answers
2
shikharV asked Jan 15, 2016
1,118 views
Given answer is 2, I think it should be 3: F,A, and G are articulation points. Please check
0 votes
0 votes
1 answer
4
atul_21 asked Dec 21, 2017
539 views
I am not convinced by this. Please explain or please tell me the source from where I can clear this out.