期刊文献+

交叉超方体的2-超边连通度 被引量:1

2-extra connectivity of crossed cubes
下载PDF
导出
摘要 网络的拓扑结构是设计和制造集群计算机或超大规模计算系统的第一步,也是实现各种协议的基础。超边连通度是衡量互联网络容错能力的一种重要的参数。文章在已有结果的基础上对交叉超方体的的超边连通度进行了进一步的研究,确定了交叉超方体的2-超边连通度为3n-4,这个结果进一步从理论上给出了交叉超方体的容错能力。 The first step in the designing and implementing large scale parallel computing system is to construct interconnection networks topological structure. Interconnection networks is also the foundation of implementing all kinds of protocol. Extra edge connectivity is an important parameter which evaluates the fault tolerance of interconnection networks. In this paper, we study extra edge connectivity of crossed cubes on the basis of some results and prove 2-extra edge connectivity is equal to 3n-4,which further gives the theoretical results of crossed cubes'fault tolerance.
出处 《长沙通信职业技术学院学报》 2008年第1期60-64,共5页 Journal of Changsha Telecommunications and Technology Vocational College
关键词 网络拓扑 交叉超方体 超边连通度 networks topological structure crossed cubes extra edge connectivity
  • 相关文献

参考文献2

二级参考文献9

  • 1朱强,徐俊明.立方体和折叠立方体的限制边连通度和超边连通度(英文)[J].中国科学技术大学学报,2006,36(3):249-253. 被引量:17
  • 2Bondy J A,Murty U S R.Graph Theory with Applications[M].New York:Elsevier,1976.
  • 3Esfahanian A H,Hakimi S L.On computer a conditional edge connectivity of graph[J].Information Processing Letters,1988,27(4):195-199.
  • 4Esfahanian A H.Generalized measures of fault tolerance with applications to N-cube networks[J].IEEE Transactions on Computers,1989,38 (11):1 586-1 591.
  • 5Harary F.Conditional connectivity[J].Networks,1983,13:346-357.
  • 6Latifi S,Hegde M,Naraghi-Pour M.Conditional connectivity measures for large multiprocessor systems[J].IEEE Transactions on Computers,1994,43(2):218-221.
  • 7Fàbrega J,Fiol M A.Extraconnectivity of graphs with large girth[J].Discrete Math.,1994,127:163-170.
  • 8El-Amawy A,Latifi S.Properties and performance of folded hypercubes[J].IEEE Transactions on Parallel and Distributed Systems,1991,2(1):31-42.
  • 9XU Jun-ming.Topological Structure and Analysis of Intercornection Networks[M].Dordrecht/Boston/London:Kluwer Academic Publishers,2001.

共引文献16

同被引文献6

  • 1朱强,徐俊明.立方体和折叠立方体的限制边连通度和超边连通度(英文)[J].中国科学技术大学学报,2006,36(3):249-253. 被引量:17
  • 2BONDY J A, MURTY U S R. Graph theory with applications[ M]. New York : American Elsevier, 1976 : 1 - 47.
  • 3LAI HONGJIAN. Group connectivity of 3 -edge-connected chor- dal graphs[ J]. Graphs and Combinatorics, 2000, 16(2) : 165 - 176.
  • 4YAO XIANGJUAN, LI XIANGWEN, LAI HONGJIAN. Degree conditions for group connectivity [ J ]. Discrete Mathematics, 2010, 310(5) : 1050 -1058.
  • 5LAI HONGJIAN, YAO XIANGJUAN. Group connectivity of graphs with diameter at most 2 [J]. European Journal of Combinatorics, 2006, 27 ( 3 ) : 436 - 443.
  • 6LAI HONGJIAN, MIAO LIANYING, SHAO YEHONG. Every line graph of a 4 - edge-connected graph is Z3 - connected[ J]. Euro- pean Journal of Combinatorics, 2009, 30(2) : 595 -601.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部