Let 𝐺 be an undirected complete graph on 𝑛 vertices, where 𝑛 > 2. Then, the…
PYQ GATE 2019
Let 𝐺 be an undirected complete graph on 𝑛 vertices, where 𝑛 > 2. Then, the number of different Hamiltonian cycles in 𝐺 is equal to
- A.
𝑛!
- B.
(𝑛 − 1)!
- C.
1
- D.
Attempted by 479 students.
Sign up free to check your answer
Sign up freeLoading lesson…

