A Sufficient Condition for Networks to be n-Neighbor d-Diagnosable under the Comparison Model  

在比较模型下网络是n-邻d-可诊断的充分条件

作　　者：WANG Shi-ying ZHAO Li-na 王世英;赵丽娜(School of Mathematics and Computer Science,Shanxi Normal University,Taiyuan 030031,China)

机构地区：[1]School of Mathematics and Computer Science,Shanxi Normal University,Taiyuan 030031,China

出　　处：《Chinese Quarterly Journal of Mathematics》2022年第4期343-354,共12页数学季刊（英文版）

基　　金：Supported by National Natural Science Foundation of China(Grant No.61772010)。

摘　　要：Diagnosability of multiprocessor systems is an important research topic.The system and an interconnection network have an underlying topology,which is usually presented by a graph.In 2012,Peng et al.proposed a metric for fault diagnosis of the graph,namely,the n-neighbor diagnosability that restrains every fault-free node to contain at least n fault-free neighbors.It is difficult to get the n-neighbor diagnosability of the graph from the definition of the n-neighbor diagnosability.Afterwards,some sufficient and necessary conditions are given.It is also difficult to find the n-neighbor diagnosability of the graph from those results.In this paper,we show some new sufficient conditions for the graph to be n-neighbor d-diagnosable under the MM*model.It improves the corresponding result of[Theoretical Computer Science 773(2019)107-114].

关 键 词：Interconnection network CONNECTIVITY DIAGNOSABILITY 

分 类 号：O157.5[理学—数学]