

InterviewSolution
Saved Bookmarks
1. |
Let G be an arbitrary graph with v nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie down between _____ and _____(a) n-1 and n+1(b) v and k(c) k+1 and v-k(d) k-1 and v-1The question was posed to me in an interview.My question is taken from Complete and Connected Graphs topic in section Graphs of Discrete Mathematics |
Answer» Right option is (d) k-1 and v-1 |
|