折叠交叉立方体的分支边连通度  

Component edge connectivity of folded crossed cubes

作　　者：蔡学鹏 徐刚刚 冯苗苗 严玉茹 Cai Xuepeng;Xu Ganggang;Feng Miaomiao;Yan Yuru(College of Mathematics and Physics,Xinjiang Agricultural University,Urumqi 830052,China)

机构地区：[1]新疆农业大学数理学院,新疆乌鲁木齐830052

出　　处：《纯粹数学与应用数学》2021年第3期370-378,共9页Pure and Applied Mathematics

基　　金：新疆自然科学基金(2021D01A98);新疆农业大学自治区级大学生创新项目(S202110758043);新疆农业大学研究生教育教学改革项目(xjauyzkc-yjs-2021006).

摘　　要：r-分支连通度(边连通度)是衡量大型互连网络可靠性和容错性的一个重要参数.设G是连通图且r是非负整数,如果G中存在某种点子集(边子集)使得G删除这种点子集(边子集)后得到的图至少有r个连通分支.则所有这种点子集(边子集)中基数最小的点子集(边子集)的基数称为图G的r分支连通度(边连通度).n-维折叠交叉立方体FCQn是由交叉立方体CQn增加2^(n−1)条边后所得.该文利用r-分支边连通度作为可靠性的重要度量,对折叠交叉立方体网络的可靠性进行分析,得到了折叠交叉立方体网络的2-分支边连通度,3-分支边连通度,4-分支边连通度.确定了折叠交叉立方体FCQn的r-分支边连通度.The r-component(resp.edge)connectivity is an important parameter in measuring the reliability and fault tolerance of large interconnection networks.Let G be a connected graph and an integer r≥0,the r-component(resp.edge)connectivity of G,is the minimum cardinality of a set of vertices(resp.edges),if it exists,whose deletion results in a graph with at least r components.The n-dimensional folded crossed cube F CQn is obtained from the crossed cube CQn by adding extra 2^(n−1) edges.The r-component edge connectivity,which is an important measure in evaluating the reliability,is utilized to analysis the reliability of folded crossed cube interconnection network.Then 2-component edge connectivity,3-component edge connectivity and 4-component edge connectivity of folded crossed cube interconnection network are obtained.In this paper,we determine the r-component edge connectivity of folded crossed cubes F CQn.

关 键 词：折叠交叉立方体 分支边连通度 互连网络 

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