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.
মোঃ আরিফুল ইসলাম
Feb 20, 2025