Conditional diagnosability of component-composition graphs under the PMC model

2020 ◽  
Vol 836 ◽  
pp. 16-28
Author(s):  
Chia-Wei Lee
2017 ◽  
Vol 12 (5) ◽  
pp. 1221-1234 ◽  
Author(s):  
Shiying Wang ◽  
Zhenhua Wang ◽  
Mujiangshan Wang ◽  
Weiping Han

2015 ◽  
pp. bxv066 ◽  
Author(s):  
Sulin Song ◽  
Shuming Zhou ◽  
Xiaoyan Li

2017 ◽  
Vol 17 (03n04) ◽  
pp. 1741001
Author(s):  
MEI-MEI GU ◽  
RONG-XIA HAO ◽  
AI-MEI YU

The g-good-neighbor conditional diagnosability is the maximum number of faulty vertices a network can guarantee to identify, under the condition that every fault-free vertex has at least g fault-free neighbors. In this paper, we study the 1-good-neighbor conditional diagnosabilities of some general k-regular k-connected graphs G under the PMC model and the MM* model. The main result [Formula: see text] under some conditions is obtained, where l is the maximum number of common neighbors between any two adjacent vertices in G. Moreover, the following results are derived: [Formula: see text] for the hierarchical star networks, [Formula: see text] for the BC networks, [Formula: see text] for the alternating group graphs [Formula: see text].


2014 ◽  
Vol 548 ◽  
pp. 79-97 ◽  
Author(s):  
Limei Lin ◽  
Shuming Zhou ◽  
Li Xu ◽  
Dajin Wang

Sign in / Sign up

Export Citation Format

Share Document