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
关键词
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 条
  • [41] On almost one-to-one maps
    Blokh, Alexander
    Oversteegen, Lex
    Tymchatyn, E. D.
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2006, 358 (11) : 5003 - 5014
  • [42] One-to-one teaching with pictures
    Hawthorne, K
    Tomlinson, S
    BRITISH JOURNAL OF GENERAL PRACTICE, 1998, 48 (426): : 923 - 923
  • [43] Competitive one-to-one promotions
    Shaffer, G
    Zhang, ZJ
    MANAGEMENT SCIENCE, 2002, 48 (09) : 1143 - 1160
  • [44] Realizing the promise of one-to-one
    Quirke, Dona
    Canadian Printer, 2002, 110 (09):
  • [45] Disjoint path covers in cubes of connected graphs
    Park, Jung-Heum
    Ihm, Insung
    DISCRETE MATHEMATICS, 2014, 325 : 65 - 73
  • [46] Going One-to-One, 2.0
    Warschauer, Mark
    Tate, Tamara
    EDUCATIONAL LEADERSHIP, 2015, 72 (08) : 60 - 65
  • [47] CONTINUOUS ONE-TO-ONE PARAMETRIZATIONS
    MAULDIN, RD
    SARBADHIKARI, H
    BULLETIN DES SCIENCES MATHEMATIQUES, 1981, 105 (04): : 435 - 444
  • [48] Working One-to-One with Students
    Davis, Jennifer
    TEACHING THEOLOGY AND RELIGION, 2010, 13 (02): : 178 - 179
  • [49] One-to-one politics in cyberspace
    Hall, M
    MEDIA STUDIES JOURNAL, 1997, 11 (01): : 97 - &
  • [50] A One-to-One Popcorn Function
    Kannai, Zoltan
    AMERICAN MATHEMATICAL MONTHLY, 2017, 124 (08): : 746 - 748