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
A Unified Formulation of Honeycomb and Diamond Networks
IEEE Transactions on Parallel and Distributed Systems
Information Processing Letters
Graph Theory With Applications
Graph Theory With Applications
Brother trees: a family of optimal 1p-Hamiltonian and 1-edge Hamiltonian graphs
Information Processing Letters
Generalized honeycomb torus is hamiltonian
Information Processing Letters
The globally Bi-3*-connected property of the honeycomb rectangular torus
Information Sciences: an International Journal
Embedding even-length cycles in a hexagonal honeycomb mesh
International Journal of Computer Mathematics
Honeycomb toroidal graphs are Cayley graphs
Information Processing Letters
Embedding a fault-free hamiltonian cycle in a class of faulty generalized honeycomb tori
Computers and Electrical Engineering
Diameter of parallelogramic honeycomb torus
Computers & Mathematics with Applications
Hamiltonian properties of honeycomb meshes
Information Sciences: an International Journal
| Hi-index | 0.89 |
Assume that m and n are positive even integers with n ≥ 4. The honeycomb rectangular torus HReT(m, n) is recognized as another attractive alternative to existing torus interconnection networks in parallel and distributed applications. It is known that any HReT(m, n) is a 3-regular bipartite graph. We prove that any HReT(m, n) - e is hamiltonian for any edge e ∈ E(HReT(m, n)). Moreover, any HReT(m, n) - F is hamiltonian for any F = {a, b} with a ∈ A and b ∈ B where A and B are the bipartition of HReT(m, n), if n ≥ 6 or m = 2.