Mutually Independent Hamiltonian Cycle of Burnt Pancake Graphs
Let G = (V, E) be a graph of order n. A Hamiltonian cycle of G is a cycle that contains every vertex in G. Two Hamiltonian cycles C(1) =   and C(2) = (v(1), v(2), ... , v(n), v(1)) of G are independent if u(1) = v(1) and u(i) # v(i) for 2  = 3.
mutually independent hamiltonian cycle burnt pancake graph