1.

All undirected Multigraphs contain eulerian cycles.(a) True(b) FalseThis intriguing question comes from Multigraph and Hypergraph in portion Graph of Data Structures & Algorithms II had been asked this question by my school teacher while I was bunking the class.

Answer»

Right ANSWER is (a) True

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



Discussion

No Comment Found

Related InterviewSolutions