Topological Properties of Hypercubes
IEEE Transactions on Computers
Updating the Hamiltonian problem—a survey
Journal of Graph Theory
The Twisted N-Cube with Application to Multiprocessing
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
A new variation on hypercubes with smaller diameter
Information Processing Letters
Fault-Tolerant Ring Embedding in de Bruijn Networks
IEEE Transactions on Computers
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
Hamiltonian properties on the class of hypercube-like networks
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Hamiltonian-like Properties of k-Ary n-Cubes
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
| Hi-index | 0.00 |
By means of analysis and generalization of the hypercube and its variations of the same topological properties and network parameters, a family of interconnection networks, referred to as binary recursive networks, is introduced in this paper. This kind of networks not only provides a powerful method to investigate the hypercube and its variations on the whole, but also puts forth an effective tool to explore new network structure. A constructive proof is presented to show that binary recursive networks are Hamiltonian based on their recursive structures, and thus a universal searching algorithm for Hamiltonian cycle in binary recursive networks is derived.