Hamiltonicity of Matching Composition Networks with Conditional Edge Faults

  • Sun-Yuan Hsieh
  • Chia-Wei Lee
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4978)

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Sun-Yuan Hsieh
    • 1
  • Chia-Wei Lee
    • 1
  1. 1.Department of Computer Science and Information EngineeringNational Cheng Kung University 

Personalised recommendations