InterviewSolution
Saved Bookmarks
| 1. |
What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.(a) n-2(b) n(c) 2(d) 0I'm obligated to ask this question of Undirected Graph in portion Graph of Data Structures & Algorithms IThis question was posed to me in an international level competition. |
|
Answer» RIGHT choice is (a) n-2 The explanation is: Only the first and the last VERTEX WOULD have degree 1, others would be of degree 2. |
|