Gate CS-2019 Question Paper With Solutions

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:

Learn More:   Gate ME-2007 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here