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 =