GATEverse Practice, past papers & mock tests
GATE 2019
Engineering MathematicsGraph TheoryeasyMCQ1 mark
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 _______
Save your progress

Related Engineering Mathematics PYQs