Revisiting Hamiltonian Decomposition of the Hypercube
Kenji Okuda, S. W. Song · 2000
1 Introduction A hypercube is an interconnection network very suitable for connecting computing elements. In this paper we study an interesting property namely the Hamiltonian decomposition. Many results on the existence of Hamiltonian cycles in graphs are known [1, 3, 4, 5, 6]. When an application uses processing elements joined as a cycle, it is important to know alternative cycles in case of communication failure in one cycle [2]. It is desirable to have a simple algorithm to construct the alternative cycles.