Chinese Quarterly Journal of Mathematics ›› 2022, Vol. 37 ›› Issue (4): 343-354.doi: 10.13371/j.cnki.chin.q.j.m.2022.04.002

Previous Articles     Next Articles

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

  

  1. School of Mathematics and Computer Science, Shanxi Normal University, Taiyuan 030031, China
  • Received:2022-11-14 Online:2022-12-30 Published:2022-12-30
  • Contact: WANG Shi-ying (1961-), male, native of Jinzhong, Shanxi, professor of Shanxi Normal University, engages in graph theory and theoretical computer science; E-mail: wangsy@sxnu.edu.cn.
  • About author:WANG Shi-ying (1961-), male, native of Jinzhong, Shanxi, professor of Shanxi Normal University, engages in graph theory and theoretical computer science; ZHAO Li-na (1995-), female, native of Shuozhou, Shanxi, PhD student of Shanxi Normal University, engages in graph theory and theoretical computer science.
  • Supported by:
    Supported by National Natural Science Foundation of China (Grant No. 61772010)

Abstract: 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]

Key words: Interconnection network, Connectivity, Diagnosability

CLC Number: