k元n方体网络的4-限制边连通度  

The 4-restricted Edge Connectivity of k-ary n-cubes

作　　者：范娜琪 林上为[1] 

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

出　　处：《河南科学》2017年第11期1735-1739,共5页Henan Science

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

摘　　要：l-限制边连通度是边连通度的推广,可更精确地度量网络的可靠性.k元n方体网络因其特殊的结构和良好的性质成为多处理机系统最常用的互连网络之一.证明了k元n方体的4-限制边连通度和它的最小4-度相等,并确定了它们的值.所得结果说明,当用4-限制边连通度作为度量指标时k元n方体是可靠的.As a generalization of edge connectivity, l-restricted edge connectivity is a more accurate index for network reliability than the edge connectivity. The k-ary n-cube is one of the most popular interconnection networks for muhiprocessor systems because of its special structure and good properties. It is shown that the 4-restricted edge connectivity of k-ary n-cube and its minimum 4-degree are equal and this value is determined. This result shows that k-ary n-cubes are reliable when the 4-restricted edge connectivity is used as the index for network reliability.

关 键 词：网络 图 可靠性 k元n方体 限制边连通度 

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