单圈图Z4生成的凯莱图CZ4在MM*模型下的1好邻诊断度  

The L-good-neighbor Diagnosability of the Cayley Graphs CZ4 Generated by Unicyclic Graphs Z4 Under the PMC Model and the MM* Model

作　　者：任佳敏 冯伟[1] 赵凌琪[2] 王世英[3] 吉日木图[1] REN Jia-min;FENG Wei;ZHAO Ling-qi;WANG Shi-ying;Jirimutu(College of Mathematics,Inner Mongolia University for Nationalities,Tongliao 028043,China;College of Computer Science and Technology,Inner Mongolia University for Nationalities,Tongliao 028043 China;School of Mathematics and Information Science,Henan Normal University,Xinxiang 453007,China)

机构地区：[1]内蒙古民族大学数学学院,内蒙古通辽028043 [2]内蒙古民族大学计算机科学与技术学院,内蒙古通辽028043 [3]河南师范大学数学与信息科学学院,河南新乡453007

出　　处：《数学的实践与认识》2018年第21期114-119,共6页Mathematics in Practice and Theory

基　　金：国家自然科学基金(61262018,61370001,61402317);内蒙古民族大学科学研究项目(NMDGP17106)

摘　　要：多处理系统的诊断度是一个重要的研究课题.一种新的系统故障诊断方法称为g好邻诊断度,它是限制每个无故障点至少包含g个无故障的邻点.证明了单圈图Z4生成的凯莱图CZ4在MM^＊模型下的1好邻诊断度是6.Diagnosability of a multiprocessor system is an important study topic. A new measure for fault diagnosis of the system is called g-good-neighbor diagnosability that restrains every fault-free node containing at least g fault-free neighbors. In this paper, we prove that the 1-good-neighbor diagnosability of CZ4 is 6 under the MM^＊ model.

关 键 词：互联网络 图 诊断度 MM^＊模型 凯莱图 

分 类 号：O157.5[理学—数学]