Vidyalelo
Data Structure · Q628

Miscellaneous on Data Structures

Programming · Data Structure · question 628

Q628

In graphs, in which all vertices have an odd degree, the number of Hamiltonian cycles through any fixed edge is always even.

A.
true
Answer
B.
false

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board