Complexity Classes on Data Structure and Algorithms related Questions and Answers


Question :   In graphs, in which all vertices have an odd degree, the number of Hamiltonian cycles through any fixed edge is always even.
1. true
2. false
3.
4.
Answer :   2 - false  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter