期刊文献+

超立方体网络的边容错二部泛连通度(英文) 被引量:2

Edge-fault-tolerant bipanconnectivity of hypercubes
下载PDF
导出
摘要 证明了对于至多有n-1条故障边的容错超立方体网络Qn,如果它正好有n-1条故障边但不关联于同一个顶点,那么对于Qn中任意两点u和v,存在一条长为l的uv非故障路,路长l满足dQn(u,v)+2≤l≤2n-1且2|(l-dQn(u,v)).这改进了许多已知结果. It was shown that for any two vertices u and v of the hypercube Qn (n≥4) with at most n- 1 faulty edges, which are not incident with the same vertex if they are exactly n- 1, there exists a fault-free uv-path of length l with do (u,v)+4≤L≤2^N-1 and 2| (l-dq(u,v)). This improves some known results.
出处 《中国科学技术大学学报》 CAS CSCD 北大核心 2008年第9期1017-1019,共3页 JUSTC
基金 NNSF of China(10671191)
关键词 哈密尔顿路 容错 超立方体网络 二部泛连通性 Hamiltonian path fault tolerance hypercube bipanconnectivity
  • 相关文献

参考文献5

  • 1Li L K, Tsai C H, Tan J M, et al. Bipanconnectivity and edge-fault-tolerant biancyclicity of hypercubes[J].Information Processing Letters, 2003,87 : 107-110.
  • 2Saad Y, Schultz M H. TolmlogicaI properties of hypercubes[J].IEEETransComput, 1988,37(7):867-872.
  • 3Wang D. Embedding Hamihonian cycles into folded hypercubes with faulty links[J].J Parallel and Distrib Comput, 2001,61 : 545-564.
  • 4Xu Jun-ming. Topological Structure and Analysis of Intereonnection Networks [M]. Dordrecht/Boston/ London: Kluwer Academic Publishers, 2001.
  • 5Xu Jun-ming, Ma Mei jie, Du Zheng-zhong. Edgefault-tolerant properties of hypercubes and folded hypercubes[J]. Australasian Journal of Combinatorics, 2006,35:7-16.

同被引文献25

  • 1徐罗娜,刘三阳,孙玉涛.Star网络的限制边连通度[J].山东理工大学学报(自然科学版),2007,21(3):12-14. 被引量:3
  • 2Gunasokaran R, Siddharth S, Krishnaraj P, et al.Efficient algo- rithms to solve broadcast scheduling problem in WiMAX mesh networks[J].Computer Communications, 2010, 33 (11) : 1325-1333.
  • 3Stewart I A,Xiang Yonghong.Bipanconnectivity and bipancyclici- ty in k-ary n-cubes[J].IEEE Transactions on Parallel and Distrib-uted Systems, 2009,20( 1 ) : 25-33.
  • 4Walker D, Latifi S.Improving bounds on link failure tolerance of the star graph[J].Information Sciences,2010,180(13.) :2571-2575.
  • 5王雷 林亚平.基于超立方体环连接Petersen图互连网络研究.计算机学报,2007,9(6):339-343.
  • 6Harary EConditional connectivity[J].Networks, 1983,13 (3) : 347-357.
  • 7Fabrega J,Fiol M A.Extraconnecfivity of graphs with large girth[J]. Discrete Mathematics; 1994,127(1/3) : 163-170.
  • 8Esfahanian A H.Generalized measures of fault tolerance with application to N-cube networks[J].IEEE Transactions on Comput- ers, 1989,38( 11 ) : 1586-1591.
  • 9Latifi S, Hegde M, Morteza N EConditional connectivity mea- sures for large multiprocessor systems[J].IEEE Transactions on Computers, 1994,43 ( 2 ) : 218-222.
  • 10Khaled D.The conditional node connectivity of the k-ary n-cube[J].Joumal of Interconnection Networks, 2004, 5 (1) : 13-26.

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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