Let G be an arbitrary graph with n nodes and k components. If a vertex is…
GATE · 2003 · CSISRO Scientist/Engineer SC · 2009 · Computer Science
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 between
- A.
k and n
- B.
k - 1 and k + 1
- C.
k - 1 and n - 1
- D.
k + 1 and n - k
Attempted by 245 students.
Sign up free to check your answer
Sign up freeLoading lesson…