计算机应用研究2017，Vol.34Issue(8)：2380-2382,2388,4.DOI:10.3969/j.issn.1001-3695.2017.08.033
无K3子图的互连网络在PMC模型下的条件可诊断度
Conditional diagnosability of K3-free graph under PMC model
摘要
Abstract
The diagnosability is an important standard to judge the reliability of the interconnection network, in order to eval-uate the capacity of a system to find the fault nodes.The PMC model is a classical diagnostic model which has applied to system diagnosis widely.There are many researches under the PMC model have been proposed.This paper studied the conditional diagnosability of K3-free graphs under the PMC model.And it proved that when the number of commom neighbors of any 2 nodes is not more than 2 with δ(G)≥9, then the conditional diagnosability of K3-free graph is 2δ(G)-1.The paper also proves that when the number of commom neighbors of any 2 nodes is not more than 2 with δ(G)≥6, the conditional diagnosability of bipartite graph is 2δ(G)-1.关键词
条件可诊断性/无K3子图的图/PMC模型/互连网络Key words
conditional diagnosability/K3-free graph/PMC model/interconnection network分类
信息技术与安全科学引用本文复制引用
曹骞,陈琪,张书奎,林政宽..无K3子图的互连网络在PMC模型下的条件可诊断度[J].计算机应用研究,2017,34(8):2380-2382,2388,4.基金项目
国家自然科学基金资助项目(61572340) （61572340）
江苏省"六大人才高峰"项目(2014-WLW-010) （2014-WLW-010）
苏州市融合通信重点实验室(SKLCC2013XX) （SKLCC2013XX）
