In a 7-node directed cyclic graph, the number of Hamiltonian cycle is to be ______

In a 7-node directed cyclic graph, the number of Hamiltonian cycle is to be ______ Correct Answer 360

A Hamiltonian cycle in a connected graph G is defined as a closed path that traverses every vertex of G exactly once except the starting vertex, at which the path also terminates. In an n-complete graph, there are (n-1)!/2 hamiltonian cycles and so the answer is 360.

Related Questions

A directed graph or digraph can have directed cycle in which ______
The Hamiltonian operator is the sum of all potential and kinetic energy operators in a wavefunction. How is this Hamiltonian represented in a 3-dimensional space?
A graph is said to be a directed graph if ________ of the graph has direction.