Let 𝐺 be an undirected complete graph on 𝑛 vertices, where 𝑛 > 2. Then, the…

GATE · 2019 · CS · Computer Science & IT

Let 𝐺 be an undirected complete graph on 𝑛 vertices, where 𝑛 > 2. Then, the number of different Hamiltonian cycles in 𝐺 is equal to

  1. A.

    𝑛!

  2. B.

    (𝑛 − 1)!

  3. C.

    1

  4. D.

    (𝑛−1)!2\frac {(𝑛−1)!} {2}

Attempted by 415 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…