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

\(\frac{{\left( {n - 1} \right)!}}{2}\)

Let G be an undirected complete graph on n vertices, where n > 2. Then

1.	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.	\(\frac{{\left( {n - 1} \right)!}}{2}\)
Answer» E.