当前位置: X-MOL 学术J. Parallel Distrib. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Subgraph fault tolerance of distance optimally edge connected hypercubes and folded hypercubes
Journal of Parallel and Distributed Computing ( IF 3.8 ) Pub Date : 2020-01-08 , DOI: 10.1016/j.jpdc.2019.12.009
Litao Guo , Chengfu Qin , Liqiong Xu

Hypercube and folded hypercube are the most fundamental interconnection networks for the attractive topological properties. We assume for any distinct vertices u,vV,κ(u,v) defined as local connectivity of u and v, is the maximum number of independent (u,v)-paths in G. Similarly, λ(u,v) is local edge connectivity of u,v. For some t[1,D(G)],u,vV,uv, and d(u,v)=t, if κ(u,v)(orλ(u,v))=min{d(u),d(v)}, then G is t-distance optimally (edge) connected, where D(G) is the diameter of G and d(u) is the degree of u. For all integers 0<kt, if G is k-distance optimally connected, then we call G is t-distance local optimally connected. Similarly, we have the definition of t-distance local optimally edge connected.

In this paper, we show that after deleting Qk(kn1), QnQk and FQnQk are 2-distance local optimally edge connected.



中文翻译:

距离最优边连接超立方体和折叠超立方体的子图容错

超立方和折叠式超立方是具有吸引人的拓扑特性的最基本的互连网络。我们假设有任何不同的顶点üvVκüv 定义为 üv,是最大独立数 üv-路径 G。同样,λüv 是的本地边缘连接 üv。对于一些Ť[1个dG]üvVüvdüv=Ť如果 κüvØ[Rλüv=一世ñ{düdv}, 然后 GŤ-最佳距离(边缘)连接,其中 dG 是的直径 Gdü 是的程度 ü。对于所有整数0<ķŤ如果 Gķ-距离最佳连接,然后我们称 GŤ-距离本地最佳连接。同样,我们有以下定义Ť-距离局部最佳边缘连接。

在本文中,我们表明删除后 ķķñ-1个ñ-ķFñ-ķ 是2距离局部最优边连接。

更新日期:2020-01-08
down
wechat
bug