Q. 19 Let G be an undirected complete graph on n vertices, where n > 2. Then, the number of different Hamiltonian cycles in G is equal to
(A) n!
(B) n – 1!
(C) 1
(D) (n-1)! / 2
Answer: (D)
Explanation:
Q. 19 Let G be an undirected complete graph on n vertices, where n > 2. Then, the number of different Hamiltonian cycles in G is equal to
(A) n!
(B) n – 1!
(C) 1
(D) (n-1)! / 2
Answer: (D)
Explanation:
