Let G be an arbitrary graph with n nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie down between
- A. k and n
- B. k - 1 and k + 1
- C. k - 1 and n
- D. k + 1 and n - k
Answer: C. k - 1 and n
Explanation: Removing a vertex can reduce components by 1 (if isolated) or increase them (if cut vertex). Max components is n-1.