The 2-good-neighbor diagnosability of wheel graph networks

Abstract

College of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan, 453007, PR China Diagnosability of a multiprocessor system is an important study topics. A new measure for fault diagnosis of the system is called the good-neighbor diagnosability that restrains every fault-free node containing at least g fault-free neighbors. As a famous topology structure of interconnection networks, the n-dimensional wheel graph network CWn has many good properties. In this paper, it is proved that the 2-good-neighbor diagnosability of CWn is 8n-15 under the PMC model and MM model for n > 5. © 2019 Utilitas Mathematica Publishing Inc.. All rights reserved.