1.

Number of vertices with odd degrees in a graph having a eulerianwalk is ________(a) 0(b) Can’t be predicted(c) 2(d) either 0 or 2I would like to ask this question from Undirected Graph topic in portion Graph of Data Structures & Algorithms IThis question was addressed to me in an online quiz.

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.



Discussion

No Comment Found

Related InterviewSolutions