Chapter

Theory and Applications of Models of Computation

Volume 4978 of the series Lecture Notes in Computer Science pp 160-169

Hamiltonicity of Matching Composition Networks with Conditional Edge Faults

  • Sun-Yuan HsiehAffiliated withDepartment of Computer Science and Information Engineering, National Cheng Kung University
  • , Chia-Wei LeeAffiliated withDepartment of Computer Science and Information Engineering, National Cheng Kung University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In this paper, we sketch structure characterization of a class of networks, called Matching Composition Networks (MCNs), to establish necessary conditions for determining the conditional fault hamiltonicity. We then apply our result to n-dimensional restricted hypercube-like networks, including n-dimensional crossed cubes, and n-dimensional locally twisted cubes, to show that there exists a fault-free Hamiltonian cycle if there are at most 2n − 5 faulty edges in which each node is incident to at least two fault-free edges. We also demonstrate that our result is worst-case optimal with respect to the number of faulty edges tolerated.

Keywords

Algorithmica aspect of network problems conditional edge faults fault-tolerance graph theory Hamiltonian cycles Hamiltonicity matching composition networks multiprocessor systems restricted hypercube-like networks