• edited by
14,157 views

5 Answers

Best answer
62 62 votes

ARTICULATION POINT: are those points whose removal from the graph makes the graph disconnected.

Here if we remove the vertex no. $2$ then we get disconnected graph.

similarly, if we remove the vertex no. $3$ then we get disconnected graph.

similarly, if we remove the vertex no. $5$ then we get disconnected graph.

So, (D) choice. 

• edited by
1 1 vote

Answer: (D)

Explanation: An articulation point is a vertex whose removal makes the graph disconnected.
There are three articulation points in the given graph, they are vertices- 2, 3, and 5
If any one of the above nodes is removed from the graph then the graph becomes disconnected.
 

1 1 vote
An articulation point(A.P)is a vertex removal of which disconnects the graph

 

So we will have to choose each vertex and check if its an A.P or not

 

4,6 and 7→ These are pendant vertices with degree 1.Removal of these vertices can never make the graph disconnected .These are like the leaf nodes in a rooted tree

 

2,3 and 5 → Nodes of degree 3.Removal of each of them will deleted the 3 edges associated with them which will make the garph disconnected

 

Removal of vertex 1 will not make it disconnected which can be clearly seen

 

Correct answer is option D
0 0 votes
Articulation points means the cut vertex. Hence there are 3 cut vertex {2,3,5}
Answer:
Position:
Show:

Related questions

43 43 votes
6 answers 6 answers
17.2k
17.2k views
Kathleen asked Sep 23, 2014
17,172 views
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is$^{n-1}C_k$$^nC_k$$^nC_{k+1}$None of the above
44 44 votes
5 answers 5 answers
11.3k
11.3k views
Kathleen asked Sep 23, 2014
11,345 views
Let $G$ be a connected, undirected graph. A cut in $G$ is a set of edges whose removal results in $G$ being broken into two or more components, which are not connected wi...
19 19 votes
1 answers 1 answer
8.3k
8.3k views
Kathleen asked Sep 23, 2014
8,262 views
What will be the output of the following program assuming that parameter passing iscall by valuecall by referencecall by copy restoreprocedure P{x, y, z}; begin y:y+1; z:...
41 41 votes
3 answers 3 answers
17.0k
17.0k views
Kathleen asked Sep 23, 2014
17,021 views
A grammar that is both left and right recursive for a non-terminal, isAmbiguousUnambiguousInformation is not sufficient to decide whether it is ambiguous or unambiguousNo...