One-to-one disjoint path covers in digraphs

被引：12
|
作者：
Cao, Huabin [1 ]
Zhang, Bicheng [1 ]
Zhou, Zhiheng [1 ]
机构：
[1] Xiangtan Univ, Dept Math & Computat Sci, Xiangtan 411105, Hunan, Peoples R China
来源：
THEORETICAL COMPUTER SCIENCE | 2018年 / 714卷
关键词：
Directed graphs; Disjoint path cover; Minimum semi-degree; RECURSIVE CIRCULANTS G(2(M); CONNECTED GRAPHS; FAULTY ELEMENTS; CUBES;
D O I：
10.1016/j.tcs.2017.12.006
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A one-to-one k-disjoint directed path cover (k-DDPC for short) of a digraph D is a set of k disjoint directed paths joining source with sink that cover all the vertices of the digraph. Let delta(0)(D) := min{delta(+) (D), delta(-) (D)) be the minimum semi-degree of D. We show that every digraph D of sufficiently large order n with delta(0)(D) >= [(n + k + 1)/2] contains a one-to-one k-DDPC for any given one distinct source-sink. The undirected version and a One-type degree conditions of this result was proved earlier [1]. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码：27 / 35
页数：9
相关论文
共 50 条
  • [1] One-to-one disjoint path covers in digraphs with faulty edges
    Jing, Ruixiao
    Sun, Yuefang
    APPLIED MATHEMATICS AND COMPUTATION, 2025, 493
  • [2] One-to-One Disjoint Path Covers in DCell
    Wang, Xi
    Fan, Jianxi
    Cheng, Baolei
    Liu, Wenjun
    Wang, Yan
    NETWORK AND PARALLEL COMPUTING, NPC 2013, 2013, 8147 : 61 - 70
  • [3] One-to-one disjoint path covers in hypercubes with faulty edges
    Wang, Fan
    Zhao, Weisheng
    JOURNAL OF SUPERCOMPUTING, 2019, 75 (08): : 5583 - 5595
  • [4] One-to-one disjoint path covers on alternating group graphs
    You, Lantao
    Fan, Jianxi
    Han, Yuejuan
    Jia, Xiaohua
    THEORETICAL COMPUTER SCIENCE, 2015, 562 : 146 - 164
  • [5] One-to-one disjoint path covers in hypercubes with faulty edges
    Fan Wang
    Weisheng Zhao
    The Journal of Supercomputing, 2019, 75 : 5583 - 5595
  • [6] One-to-one Disjoint Path Covers on WK-networks
    You, Lantao
    Han, Yuejuan
    MATERIAL SCIENCE, CIVIL ENGINEERING AND ARCHITECTURE SCIENCE, MECHANICAL ENGINEERING AND MANUFACTURING TECHNOLOGY II, 2014, 651-653 : 1875 - +
  • [7] One-to-one disjoint path covers on multi-dimensional tori
    Li, Jing
    Liu, Di
    Yang, Yuxing
    Yuan, Jun
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2015, 92 (06) : 1114 - 1123
  • [8] One-to-one Disjoint-path Covers of Leaf-sort Graphs
    Wang, Shiying
    Wang, Huanhuan
    Zhao, Lina
    Feng, Wei
    PARALLEL PROCESSING LETTERS, 2024, 34 (03N04)
  • [9] One-to-one disjoint path covers on k-ary n-cubes
    Shih, Yuan-Kang
    Kao, Shin-Shin
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (35) : 4513 - 4530
  • [10] One-to-one conditional path covers on augmented cubes
    Kandekar, S. A.
    Mane, S. A.
    Waphare, B. N.
    JOURNAL OF THE RAMANUJAN MATHEMATICAL SOCIETY, 2021, 36 (04) : 309 - 323
12345