Computer Sciences > Gate 2019 > Graph Theory
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
Correct : d
Similar Questions
The minimum number of colours that is sufficient to vertex-colour any planar graph is _______________
The minimum number of colours that is sufficient to vertex-colour any planar graph is _______________
The minimum number of colours that is sufficient to vertex-colour any planar graph is _______________
Total Unique Visitors
Loading......