The 2-good-neighbor diagnosability of wheel graph networks

摘要

Diagnosability of a multiprocessor system is an important study topics. A new measure for fault diagnosis of the system is called the g-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 MW* model for n >= 5.