1.

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-1(D) k+1 and n-k

Answer»


Discussion

No Comment Found

Related InterviewSolutions