Relationship between diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model

被引：2

作者：

Ding, Tongtong ^{[1
]}

Xu, Min ^{[1
]}

机构：

[1] Beijing Normal Univ, Sch Math Sci, Lab Math & Complex Syst, Minist Educ, Beijing 100875, Peoples R China

来源：

THEORETICAL COMPUTER SCIENCE | 2023年 / 944卷

基金：

中国国家自然科学基金;

关键词：

Diagnosability; Non -inclusive diagnosability; PMC model; CONDITIONAL DIAGNOSABILITY; NETWORKS; ALGORITHM;

D O I：

10.1016/j.tcs.2022.12.026

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Diagnosability, defined as the maximum number of fault processors that the system can recognize, is an important parameter in the design and maintenance of multiprocessor systems. To improve diagnosability, Ding et al. [5] proposed the non-inclusive diagnosabil-ity. In this paper, we discuss the relationship between the diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model. We use the non -inclusive diagnosability of some regular graphs as examples in our discussion.(c) 2022 Elsevier B.V. All rights reserved.

引用

页数：9

共 34 条

[31] The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model
Wang, Mujiangshan
Lin, Yuqing
Wang, Shiying
THEORETICAL COMPUTER SCIENCE, 2016, 628 : 92 - 100
[32] The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model
Wang, Mujiangshan
Guo, Yubao
Wang, Shiying
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2017, 94 (03) : 620 - 631
[33] The g-Good-Neighbor Diagnosability of Bubble-Sort Graphs under Preparata, Metze, and Chien's (PMC) Model and Maeng and Malek's (MM)* Model
Wang, Shiying
Wang, Zhenhua
INFORMATION, 2019, 10 (01)
[34] The Relationship Between the g-Extra Connectivity and the g-Extra Diagnosability of Networks Under the MM* Model
Yuan, Jun
Liu, Aixia
Wang, Xi
COMPUTER JOURNAL, 2021, 64 (06): : 921 - 928

← 1 2 3 4 →