Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles in Twisted Cubes

TL;DR

This paper constructs two edge-disjoint Hamiltonian cycles and two equal node-disjoint cycles in twisted cubes, enhancing network robustness and algorithmic efficiency in interconnection networks.

Contribution

It introduces methods to decompose twisted cubes into disjoint Hamiltonian cycles and equal node-disjoint cycles for odd dimensions, a novel structural insight.

Findings

Existence of two edge-disjoint Hamiltonian cycles in TQ_n for odd n≥5.

Construction of two equal node-disjoint cycles in TQ_n for odd n≥3.

Decomposition of twisted cubes into two equal-sized Hamiltonian components.

Abstract

The hypercube is one of the most popular interconnection networks since it has simple structure and is easy to implement. The $n$-dimensional twisted cube, denoted by $TQ_n$, an important variation of the hypercube, possesses some properties superior to the hypercube. Recently, some interesting properties of $TQ_n$ were investigated. In this paper, we construct two edge-disjoint Hamiltonian cycles in $TQ_n$ for any odd integer $n\geqslant 5$. The presence of two edge-disjoint Hamiltonian cycles provides an advantage when implementing two algorithms that require a ring structure by allowing message traffic to be spread evenly across the twisted cube. Furthermore, we construct two equal node-disjoint cycles in $TQ_n$ for any odd integer $n\geqslant 3$, in which these two cycles contain the same number of nodes and every node appears in one cycle exactly once. In other words, we decompose a twisted cube into two components with the same size such that each component contains a Hamiltonian cycle.