+1 vote
in Data Structures & Algorithms I by (88.2k points)
All undirected Multigraphs contain eulerian cycles.

(a) True

(b) False

This intriguing question comes from Multigraph and Hypergraph in portion Graph of Data Structures & Algorithms I

I had been asked this question by my school teacher while I was bunking the class.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Right answer is (a) True

The explanation is: Only graphs with every vertex having even degree have eulerian circuits or cycles.

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.