Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4952367 | Theoretical Computer Science | 2017 | 10 Pages |
Abstract
The conditional diagnosability of many well-known networks has been explored. In this paper, we analyze the conditional diagnosability of a family of networks, called the round matching composition networks, which are a class of networks composed of r (râ¥4) components of the same order linked by r perfect matchings. Applying the result, we determine the conditional diagnosability of the k-ary n-cubes and the recursive circulant graphs under the PMC model and the MM model, respectively.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jia Guo, Mei Lu,