Computer Engineering and Applications ›› 2017, Vol. 53 ›› Issue (2): 72-78.DOI: 10.3778/j.issn.1002-8331.1604-0435

Previous Articles     Next Articles

 2-disjoint path covers in k-ary 3-cubes with fault edges

GUAN Wenhui, LI Jing, GAO Xiaohui   

  1. School of Applied Science, Taiyuan University of Science and Technology, Taiyuan 030024, China
  • Online:2017-01-15 Published:2017-05-11

边故障K元3立方体的二不交路覆盖

管文慧,李  晶,高晓慧   

  1. 太原科技大学 应用科学学院,太原 030024

Abstract: The paper studies the problem of 2-disjoint paths cover of k-ary 3-cube. Let [F] be any subset of edges with [|F|] no more than 3. In this paper, the following result is obtained. For arbitrarily two original points and two sink points in [Qk3], there exist two fault-free vertex-disjoint paths [P1] and [P2] between a original point and a sink point separately, such that cover of [Qk3].

Key words: interconnection network, k-ary 3-cube, disjoint paths cover

摘要: 研究具有故障边的[k]元3立方体的非指定二不交路覆盖问题。证明了在具有至多3条故障边的[k]元3立方体[Qk3]中,任意给定两个源点和两个汇点,则存在两条顶点不交的路[P1]和[P2],分别连接一个源点和汇点,且[V(P1)?V(P2)=V(Qk3)]。

关键词: 互连网络, [k]元3立方体, 不交路覆盖