| 注册
首页|期刊导航|计算机工程与应用|边故障K元3立方体的二不交路覆盖

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

管文慧 李晶 高晓慧

计算机工程与应用2017,Vol.53Issue(2):72-78,117,8.
计算机工程与应用2017,Vol.53Issue(2):72-78,117,8.DOI:10.3778/j.issn.1002-8331.1604-0435

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

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

管文慧 1李晶 1高晓慧1

作者信息

  • 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 .

关键词

互连网络/k元3立方体/不交路覆盖

Key words

interconnection network/k-ary 3-cube/disjoint paths cover

分类

数理科学

引用本文复制引用

管文慧,李晶,高晓慧..边故障K元3立方体的二不交路覆盖[J].计算机工程与应用,2017,53(2):72-78,117,8.

基金项目

国家自然科学基金(No.61303020);山西省高等学校优秀青年学术带头人支持计划(No.20151005)。 ()

计算机工程与应用

OA北大核心CSCDCSTPCD

1002-8331

访问量0
|
下载量0
段落导航相关论文