The diagnosability of the matching composition network under the comparison diagnosis model

Abstract

The classical problem of diagnosability is discussed widely and the diagnosability of many well-known networks have been explored. In this paper, we consider the diagnosability of a family of networks, called the Matching Composition Network (MCN); two components are connected by a perfect matching. The diagnosability of MCN under the comparison model is shown to be one larger than that of the component, provided some connectivity constraints are satisfied. Applying our result, the diagnosability of the Hypercube Q(n), the Crossed cube CQ(n), the Twisted cube TQ(n), and the Mobius cube MQ(n) can all be proven to be n, for n greater than or equal to 4. In particular, we show that the diagnosability of the four-dimensional Hypercube Q(4) is 4, which is not previously known.