The diagnosability is an essential subject for the reliability of a multiple CPU system. As a celebrated topology structure of interconnection networks, an n-dimensional wheel network CWn has numerous great features. In this paper, we discuss the diagnosability of CWn with missing edges under the comparison model. Both the local diagnosability and the strong local diagnosability feature are studied; this feature depicts the equivalence of the local diagnosability of a node and its degree. We demonstrate that CWn(n≥6) possesses this feature, containing the strong feature even with up to 2n−4 missing edges in it, and the outcome is ideal regarding the amount of missing edges.
Connectivity is a significant metric for evaluating the error lenience of an interconnected net G=V,E. In the paper (Fàbrega and Fiol, 1996), the authors addressed the g-extra connectivity which is applied to better measure the consistency and error tolerance of G. As a special Cayley graph, the n-dimensional wheel network CWn has some desirable features. This paper shows that the g-extra connectivity of CWnn≥6 is 6n−12 when g=2.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.