排列图的限制边连通度  

Restricted Edge Connectivity of Arrangement Graphs

作　　者：邹婷婷 曾雪倩 李向军[1] ZOU Tingting;ZENG Xueqian;LI Xiangjun(School of Information and Mathematics,Yangtze University,Jingzhou 434023,China)

机构地区：[1]长江大学信息与数学学院,湖北荆州434023

出　　处：《湖北民族大学学报（自然科学版）》2021年第1期53-55,110,共4页Journal of Hubei Minzu University:Natural Science Edition

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

摘　　要：限制边连通度λh是度量互连网络容错性的一个重要参数,排列图A n,k是星图的推广,但它的阶比星图有更好的灵活性.当k=2、h≤3时,利用图结构分析的方法确定了排列图A n,2的限制边连通度λh(A n,2),该结论对一般排列图的容错度量有借鉴意义.The restricted edge connectivityλh is an important parameter to measure the fault tolerance of interconnection networks.Arrangement graph is a generalization of star graph,but its order is more flexible than star graph.In this paper,for k=2 and h≤3,by using the method of graph structural analysis,the restricted edge connectivityλh of the arrangement graphs A n,2 is determined.This result can be used for the reference in the measurement of fault tolerance for general arrangement graphs.

关 键 词：容错性 限制边连通度 排列图 互连网络 

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