Hamiltonicity and Pancyclicity of binary recursive networks

Authors:
Yun Sun;Zhoujun Li;Deqiang Wang
Affiliations:
School of Computer, National University of Defense Technology, China;School of Computer Science and Engineering, Beihang University, China;Institute of Nautical Science and Technology, Dalian Maritime University, China
Venue:
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Year:
2007

Citing 14
Cited 0

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
The Möbius Cubes

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
Graph Theory With Applications

Graph Theory With Applications
Hamiltonian-like Properties of k-Ary n-Cubes

PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Node-pancyclicity and edge-pancyclicity of hypercube variants

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 structures. A constructive proof is presented to show that binary recursive networks are Hamiltonian based on their recursive structures, and an approach to prove 4-pancyclicity of a subfamily of binary recursive networks is outlined.