期刊名称:American Journal of Computational Mathematics
印刷版ISSN:2161-1203
电子版ISSN:2161-1211
出版年度:2016
卷号:06
期号:03
页码:259-266
DOI:10.4236/ajcm.2016.63027
语种:English
出版社:Scientific Research Publishing
摘要:Diagnosability of a multiprocessor system is one important study topic. In 2012, Peng et al. proposed a measure for fault tolerance of the system, which is called the g-good-neighbor diagnosability that restrains every fault-free node containing at least g fault-free neighbors. In 2015, Zhang et al. proposed a measure for fault diagnosis of the system, namely, g-extra diagnosability, which restrains that every fault-free component has at least g+1 fault-free nodes. In this paper, we obtain some properties of the g-good-neighbor (g-extra) diagnosability of the system and give the g-good-neighbor (g-extra) diagnosability of some graphs under the PMC model and MM* model.