Honeycomb Networks: Topological Properties and Communication Algorithms
IEEE Transactions on Parallel and Distributed Systems
Honeycomb tori are Hamiltonian
Information Processing Letters
A Unified Formulation of Honeycomb and Diamond Networks
IEEE Transactions on Parallel and Distributed Systems
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Ring embedding in faulty honeycomb rectangular torus
Information Processing Letters
Information Processing Letters
Generalized honeycomb torus is hamiltonian
Information Processing Letters
Diameter of parallelogramic honeycomb torus
Computers & Mathematics with Applications
Embedding a fault-free hamiltonian cycle in a class of faulty generalized honeycomb tori
Computers and Electrical Engineering
Hi-index | 0.00 |
The existence and construction of cycles of various lengths in an interconnection network are important issues in efficiently executing ring-structured parallel algorithms in such a network. The hexagonal honeycomb mesh (HHM) is regarded as a promising candidate for interconnection networks. In this paper we address the problem of how to embed even-length cycles in an HHM. We prove that an HHM of order t≥3 admits a cycle of length l for each even number l such that l=6 or 10≤l≤6t2-2. We also describe a systematic method for building these cycles.