On the Diagnosability of Some Networks by the Comparison Approach

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 diagnos- ability 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 showed to be one larger than that of the component, provided some connectivity constraint. Applying our result, the diagnosability of Hypercubes Qn, Crossed cube CQn, Twisted cube TQn, and Mobius cube MQn can all be proved to be n, for n 4. In particular, we show that the diagnosability of the 4-dimensional hypercube, Q4, is 4 which is not previously known.