Conditional edge-fault-tolerant Hamiltonicity of dual-cubes

Authors:
Jheng-Cheng Chen;Chang-Hsiung Tsai
Affiliations:
Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien 970, Taiwan, ROC;Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien 970, Taiwan, ROC
Venue:
Information Sciences: an International Journal
Year:
2011

Citing 19
Cited 7

Architecture and Applications of the Connection Machine

Computer
On the existence of Hamiltonian circuits in faulty hypercubes

SIAM Journal on Discrete Mathematics
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes

SIAM Journal on Discrete Mathematics
Fault-tolerant hamiltonian laceability of hypercubes

Information Processing Letters
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs

IEEE Transactions on Computers
Efficient Collective Communications in Dual-Cube

The Journal of Supercomputing
Linear array and ring embeddings in conditional faulty hypercubes

Theoretical Computer Science
Pancyclicity on Möbius cubes with maximal edge faults

Parallel Computing
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges

IEEE Transactions on Computers
On reliability of the folded hypercubes

Information Sciences: an International Journal
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes

Information Sciences: an International Journal
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults

Information Sciences: an International Journal
Fault-tolerant cycle embedding in dual-cube with node faults

International Journal of High Performance Computing and Networking
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults

Theoretical Computer Science
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model

Information Sciences: an International Journal
Many-to-many disjoint paths in faulty hypercubes

Information Sciences: an International Journal
Long paths and cycles in hypercubes with faulty vertices

Information Sciences: an International Journal
On embedding cycles into faulty twisted cubes

Information Sciences: an International Journal

Reordering columns for smaller indexes

Information Sciences: an International Journal
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees

Information Sciences: an International Journal
Bipolar fuzzy graphs

Information Sciences: an International Journal
Conditional connectivity of star graph networks under embedding restriction

Information Sciences: an International Journal
Conditional diagnosability of matching composition networks under the MM* model

Information Sciences: an International Journal
Hamiltonian properties of honeycomb meshes

Information Sciences: an International Journal
The domination number of exchanged hypercubes

Information Processing Letters

Quantified Score

Hi-index	0.07

Visualization

Abstract

The dual-cube is an interconnection network for linking a large number of nodes with a low node degree. It uses low-dimensional hypercubes as building blocks and keeps the main desired properties of the hypercube. A dual-cube DC(n) has n+1 links per node where n is the degree of a cluster (n-cube), and one more link is used for connecting to a node in another cluster. In this paper, assuming each node is incident with at least two fault-free links, we show a dual-cube DC(n) contains a fault-free Hamiltonian cycle, even if it has up to 2n-3 link faults. The result is optimal with respect to the number of tolerant edge faults.