Generalized honeycomb torus is Hamiltonian

Generalized honeycomb torus is a candidate for interconnection network architectures, which includes honeycomb torus, honeycomb rectangular torus, and honeycomb parallelogramic torus as special cases. Existence of Hamiltonian cycle is a basic requirement for interconnection networks since it helps map a "token ring" parallel algorithm onto the associated network in an efficient way. Cho and Hsu [Inform. Process. Lett. 86 (4) (2003) 185-190] speculated that every generalized honeycomb torus is Hamiltonian. In this paper, we have proved this conjecture.

[1]  Xiaofan Yang,et al.  Honeycomb tori are Hamiltonian , 1999, Inf. Process. Lett..

[2]  Jean Frédéric Myoupo,et al.  All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications , 1999, Parallel Process. Lett..

[3]  Behrooz Parhami,et al.  A Unified Formulation of Honeycomb and Diamond Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[4]  Ivan Stojmenovic,et al.  Honeycomb Networks: Topological Properties and Communication Algorithms , 1997, IEEE Trans. Parallel Distributed Syst..

[5]  Frank Harary,et al.  Graph Theory , 2016 .

[6]  Li-Yen Hsu,et al.  Generalized honeycomb torus , 2003, Inf. Process. Lett..

[7]  Li-Yen Hsu,et al.  Ring embedding in faulty honeycomb rectangular torus , 2002, Inf. Process. Lett..

[8]  Xiaofan Yang,et al.  Fault-Tolerant Ring Embedding in a Honeycomb Torus with Node Failures , 1999, Parallel Process. Lett..

[9]  Behrooz Parhami.  Introduction to Parallel Processing , 2002, Series in Computer Science.

[10]  Xiaofan Yang.  The diameter of Honeycomb rhombic tori , 2004, Appl. Math. Lett..