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 条
12345