By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Pao-Lien Lai ; Dept. of Comput. Sci. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; J. J. M. Tan ; Chang-Hsiung Tsai ; Lih-Hsing Hsu

The classical problem of diagnosability is discussed widely and the diagnosability of many well-known networks has been explored. We consider the diagnosability of a family of networks, called the matching composition network (MCN); a perfect matching connects two components. 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 Qn, the crossed cube CQn, the twisted cube TQn, and the Mobius cube MQn can all proven to be n, for n≥4. In particular, we show that the diagnosability of the four-dimensional hypercube Q4 is 4, which is not previously known.

Published in:

IEEE Transactions on Computers  (Volume:53 ,  Issue: 8 )