Honeycomb rectangular disks

Authors:
Yuan-Hsiang Teng;Jimmy J. M. Tan;Lih-Hsing Hsu
Affiliations:
Department of Computer and Information Science, National Chiao Tung University, Hsinchu City, Taiwan 300, ROC;Department of Computer and Information Science, National Chiao Tung University, Hsinchu City, Taiwan 300, ROC;Department of Computer Science and Information Engineering, Ta Hwa Institute of Technology, Hsinchu County, Taiwan 307, ROC
Venue:
Parallel Computing
Year:
2005

Citing 5
Cited 0

Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors

IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
An Efficient Dictionary Machine Using Hexagonal Processor Arrays

IEEE Transactions on Parallel and Distributed Systems
Honeycomb Networks: Topological Properties and Communication Algorithms

IEEE Transactions on Parallel and Distributed Systems
Honeycomb tori are Hamiltonian

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a variation of honeycomb meshes. A honeycomb rectangular disk HReD(m,n) is obtained from the honeycomb rectangular mesh HReM(m,n) by adding a boundary cycle. A honeycomb rectangular disk HReD(m,n) is a 3-regular planar graph. It is obvious that the honeycomb rectangular mesh HReM(m,n) is a subgraph of HReD(m,n). We also prove that HReD(m,n) is hamiltonian. Moreover, HReD(m,n)-f remains hamiltonian for any f@?V(HReD(m,n))@?E(HReD(m,n)) if n=6.