在比较模型下网络是n-邻d-可诊断的充分条件(英文) |
| |
引用本文: | 王世英,赵丽娜.在比较模型下网络是n-邻d-可诊断的充分条件(英文)[J].数学季刊,2022(4):343-354. |
| |
作者姓名: | 王世英 赵丽娜 |
| |
作者单位: | School of Mathematics and Computer Science, Shanxi Normal University |
| |
基金项目: | 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. After...
|
|
|