k元n方体网络关于极大局部连通性的容错度  

The fault tolerance of k-ary n-cubes with respect to maximally local connectivity

作　　者：景小飞 林上为[1] JING Xiao-fei;LIN Shang-wei(School of Mathematical Sciences,Shanxi University,Taiyuan 030006,China)

机构地区：[1]山西大学数学科学学院,山西太原030006

出　　处：《云南民族大学学报（自然科学版）》2018年第6期479-482,共4页Journal of Yunnan Minzu University:Natural Sciences Edition

基　　金：国家自然科学基金(61202017)

摘　　要：k元n方体因其良好的拓扑性质和特殊的结构成为多处理机系统最常用的互连网络之一.图的局部连通度是衡量网络可靠性的重要参数.极大局部连通图是以局部连通度为度量指标时最可靠的一类网络.证明了具有至多2n-2个故障点的k元n方体网络仍具有极大局部连通性.The k -ary n -cube becomes one of the most common interconnection networks for multiprocessor systems because of its good topological property and special structure. The local connectivity of a graph is an important measure for network reliability. Using the local connectivity as the reliability indicator, the maximally local connected graphs are a class of the most reliable networks. It is proved that the k -ary n -cube with up to 2 n -2 faulty vertices is still maximally local connected.

关 键 词：网络 k元n方体 极大局部连通性 容错度 

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