Embedding Three Edge-Disjoint Hamiltonian Cycles into Locally Twisted Cubes

The n-dimensional locally twisted cube LTQ(n), a variation of the hypercube Q(n), has the same number of vertices and the same number of edges as Q(n), but it has only about half of the diameter of Q(n). The existence of the Hamiltonian cycle provides an advantage when implementing algorithms that require a ring structure. In addition, k (>= 2) edge-disjoint Hamiltonian cycles also provide the edge-fault tolerant Hamiltonicity for the interconnection network. Hung [Theoretical Computer Science 412, 4747-4753, 2011] proved that LTQ(n) with n >= 4 contains two edge-disjoint Hamiltonian cycles, and posted an open problem what is the maximum number of edge-disjoint Hamiltonian cycles in LTQ(n) for n >= 6? In this paper, we show that there exist three edge-disjoint Hamiltonian cycles on LTQ(n) while n >= 6.