A

Admin • 828.03K Points
Coach

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

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
Explanation by: Admin
according to a handshaking lemma, in graphs, in which all vertices have an odd degree, the number of hamiltonian cycles through any fixed edge is always even.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.