+1 vote
in Data Structures & Algorithms I by (88.2k points)
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) 0

I'm obligated to ask this question of Undirected Graph in portion Graph of Data Structures & Algorithms I

This question was posed to me in an international level competition.

1 Answer

+1 vote
by (737k points)
selected by
 
Best 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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...