GATE CS 2019 (Forenoon) — Question 22

Discrete MathematicsGraph Theory (Connectivity, Paths, Cycles, Trees)MCQ1 mark · −1/3 if wrongMedium

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
  1. A
    \( n! \)
  2. B
    \( (n - 1)! \)
  3. C
    1
  4. D
    \( \frac{(n - 1)!}{2} \)
Practise the full 2019-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
Practise more on Graph Theory (Connectivity, Paths, Cycles, Trees)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group