4.5 Article

Subgraph fault tolerance of distance optimally edge connected hypercubes and folded hypercubes

期刊

出版社

ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jpdc.2019.12.009

关键词

Interconnection networks; Fault-tolerance; Path; Distance

资金

  1. National Natural Science Foundation of China [11961051]
  2. Natural Science Foundation of Fujian Province, China [2019J01857, 2018J01419]
  3. Xiamen University of Technology, PR China [XPDKT19001]
  4. Sponsoring Agreement for Overseas Studies in Fujian Province, PR China

向作者/读者索取更多资源

Hypercube and folded hypercube are the most fundamental interconnection networks for the attractive topological properties. We assume for any distinct vertices u, v is an element of V, kappa(u, v) defined as local connectivity of u and v, is the maximum number of independent (u, v)-paths in G. Similarly, lambda(u, v) is local edge connectivity of u, v. For some t is an element of [1, D(G)], for all u. v is an element of V, u not equal A v, and d(u, v) = t, if kappa(u, v)(or lambda(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 < k <= t, if C 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 Q(k) (k <= n - 1), Q(n) - Q(k) and FQ(n), - Q(k) are 2-distance local optimally edge connected. (C) 2019 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据