有向Kautz图的好邻连通度  

Good Neighbor Connectivity of Directed Kautz Digraphs

作　　者：李美莲 林上为[1] LI Meilian;LIN Shangwei(School of Mathematical Sciences,Shanxi University,Taiyuan 030006,China)

机构地区：[1]山西大学数学科学学院

出　　处：《河南科技大学学报（自然科学版）》2019年第5期86-89,M0007,共5页Journal of Henan University of Science And Technology:Natural Science

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

摘　　要：有向Kautz图是并行计算系统的一类重要网络。根据实际应用中并行计算系统的故障分布情况,提出了有向图的好邻连通度的概念,该连通度是比传统连通度更精确的网络可靠性指标,并证明了有向Kautz图K(d,n)的好邻连通度为2d-2。Directed Kautz digraphs are a kind of important networks in parallel computing systems.According to the faults distribution of parallel computing systems in practical application,the concept of good neighbor connectivity of directed digraphs was presented,which was a more accurate indicator for network reliability than the traditional connectivity.It was proved that the good neighbor connectivity of the directed Kautz digraph K(d,n)is 2d-2.

关 键 词：网络 可靠性 有向Kautz图 好邻连通度 

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