Question

An articulation point in a connected graph is a vertex such that removing the vertex and its incident edges disconnects the graph into two or more connected components. Let \(T\) be a DFS tree obtained by doing DFS in a connected undirected graph \(G\). Which of the following options is/are correct?

• A. Root of \(T\) can never be an articulation point in \(G\).
• B. Root of \(T\) is an articulation point in \(G\) if and only if it has two or more children.
• C. A leaf of \(T\) can be an articulation point in \(G\).
• D. If \(u\) is an articulation point in \(G\) such that \(x\) is an ancestor of \(u\) in \(T\) and \(y\) is a descendant of \(u\) in \(T\), then all paths from \(x\) to \(y\) in \(G\) must pass through \(u\).

Hint:

In DFS, the root is special: it is an articulation point only when it has two or more DFS children.

Answer 1

The Correct Option is B

Step 1: DFS root property.
In a Depth First Search (DFS) traversal of an undirected graph, the root of the DFS tree is an articulation point if and only if it has two or more children.

Therefore, statement (B) is correct.

---

Step 2: Verification of remaining statements.

Statement (A): Incorrect, because the DFS root can be an articulation point under the condition stated above.

Statement (C): Incorrect, since removing a leaf node from a DFS tree does not disconnect the graph.

Statement (D): Incorrect, because the existence of back edges can provide alternate paths, preventing disconnection even if a vertex is removed.

---

Final Conclusion:
The only correct option is (B).