Let be an undirected complete graph on vertices, where . Then, the number of different Hamiltonian cycles in is equal to
- A
- B
- C1
- D
Discrete MathematicsGraph Theory (Connectivity, Paths, Cycles, Trees)MCQ1 mark · −1/3 if wrongMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.