期刊文献+

星型网络的3-限制边连通性 被引量:3

3-restricted edge connectivity of star graph networks
在线阅读 下载PDF
导出
摘要 星型互连网络是并行与分布式处理领域中最流行的互连网络之一,它以n维星图作为拓扑结构。k-限制边连通度是衡量网络的可靠性的参数之一。一般来说,一个网络的k-限制边连通度越大,其连通性就越好。研究了星型互连网络的k限制边连通度;证明了当n≥3时,n维星型互连网络的3-限制连通度为3n-7。 The n-dimensional star graph Sn is one of the most popular interconnection networks and the k-restricted edge connectivity of a graph G is the minimum cardinality of a set of edges, if any, whose deletion disconnects G and every remaining component has at least k vertices. The k-restricted edge connectivity is one of the most parameters to evaluate the reliability of a network. In general, the larger the k-restricted edge connectivity of a network is, the more reliable the network is. The k-restricted edge connectivity of n-dimensional star graph is investigated and the result that the 3-restricted edge connectivity of Sn is 3n-7 for n≥3 is proved.
出处 《计算机工程与应用》 CSCD 2012年第7期81-83,共3页 Computer Engineering and Applications
基金 国家自然科学基金(No.41001251)
关键词 互连网络 k-限制边连通度 可靠性 星型网络 interconnection networks k-restricted edge connectivity reliability star graph networks
  • 相关文献

参考文献12

  • 1Gunasekaran R, Siddharth S, Krishnaraj P, et al.Efficient algorithms to solve broadcast scheduling problem in WiMAX mesh networks[J].Computer Communications, 2010,33 ( 11 ) : 1325-1333.
  • 2经紟,杜正中,马美杰,徐俊明.超立方体网络的边容错二部泛连通度(英文)[J].中国科学技术大学学报,2008,38(9):1017-1019. 被引量:2
  • 3Stewart I A,Xiang Yonghong.Bipanconnectivity and bipancyclicity in k-ary n-cubes[J].IEEE Transactions on Parallel and Distributed 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.
  • 6李银,梁家荣.故障超立方体网络中的路由算法[J].计算机工程与应用,2009,45(18):120-122. 被引量:1
  • 7Abdol-Hossein E, Louis H S.On computing a conditional edge-connectivity of a graph[J].Information Processing Letters, 1988,27(4) : 195-199.
  • 8Fabrega J, Fiol M.A.Extraconnectivity of graphs with large girth[J]. Discrete Mathematics, 1994,127( 1/3 ) : 163-170.
  • 9Wang Shiying, Yuan Jun, Liu Aixia.k-restricted edge connectivity for some interconnection networks[J].Applied Mathematics and Computation, 2008,201 ( 1/2) 587-596.
  • 10Ou Jianping, Cheng Xiaohong, Wu Jichang.On 3-restricted edge connectivity of undirected binary Kautz graphs[J].Discrete Mathematics, 2009,309(4) : 629-638.

二级参考文献15

  • 1林玮,杨小帆.基于超立方体容错路由算法分析[J].计算机应用研究,2007,24(7):273-275. 被引量:2
  • 2Li 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.
  • 3Saad Y, Schultz M H. TolmlogicaI properties of hypercubes[J].IEEETransComput, 1988,37(7):867-872.
  • 4Wang D. Embedding Hamihonian cycles into folded hypercubes with faulty links[J].J Parallel and Distrib Comput, 2001,61 : 545-564.
  • 5Xu Jun-ming. Topological Structure and Analysis of Intereonnection Networks [M]. Dordrecht/Boston/ London: Kluwer Academic Publishers, 2001.
  • 6Xu 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.
  • 7Esfahanian A H,Hakimi S L.On computing a conditional edge-connectivity of a graph[J].Information Processing Letters,1988,27:195-199.
  • 8Bondy J A,Murty U S R.Graph Theorey with Applications[M].New York:North Holland,1976.
  • 9Esfahanian A H,Generalized measures of fault tolerance with application to n-cube networks[J].IEEE Trans.Comput,1989,38(11):1 586-1 591.
  • 10Day K,Triphi A.A comparative study of topological properties of hypercubes and star graphs[J].IEEE Trans.Parallel and Distributed Systems,1994,5(1):31-38.

共引文献4

同被引文献26

  • 1魏运,白文飞,李宇杰.智慧地铁需求分析及功能规划研究[J].都市快轨交通,2020,33(1):40-48. 被引量:42
  • 2徐罗娜,刘三阳,孙玉涛.Star网络的限制边连通度[J].山东理工大学学报(自然科学版),2007,21(3):12-14. 被引量:4
  • 3Maeda H,Masuda M,Panov T.Torus graphs and simplicial posets[J].Advances in Mathematics,2007,212(2):458-483.
  • 4Luo Junzhou,Ni Xudong,Yong Jianming.A trust degree based access control in grid environments[J].Information Sciences,2009,179(15):2618-2628.
  • 5Xiang Dong,Chen Ai,Sun Jiaguang.Fault-tolerant multi-casting in hypercubes using local safety information[J].Journal of Parallel and Distributed Computing,2006,66(22):248-256.
  • 6Fu Jungsheng.Conditional fault-tolerant hamiltonicity of star graphs[J].Parallel Computing,2007,33(7/8):488-496.
  • 7Abdol-Hossein E,Louis H S.On computing a conditional edge-connectivity of a graph[J].Information Processing Letters,1988,27(4):195-199.
  • 8Fàbrega J,Fiol M A.Extraconnectivity of graphs with large girth[J].Discrete Mathematics,1994,127(1/3):163-170.
  • 9Ou Jianping,Cheng Xiaohong,Wu Jichang.On3-restricted edge connectivity of undirected binary Kautz graphs[J].Discrete Mathematics,2009,309(4):629-638.
  • 10Wang Shiying,Lin Shangwei.The k-restricted edge connectivity of undirected Kautz graphs[J].Discrete Mathematics,2009,309(13):4649-4652.

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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