+1 vote
in Data Structures & Algorithms I by (88.2k points)
Number of vertices with odd degrees in a graph having a eulerian  walk is ________

(a) 0

(b) Can’t be predicted

(c) 2

(d) either 0 or 2

I would like to ask this question from Undirected Graph topic in portion Graph of Data Structures & Algorithms I

This question was addressed to me in an online quiz.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Right answer is (d) either 0 or 2

Explanation: If the start and end vertices for the path are same the answer would be 0 otherwise 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.