کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8902958 | 1632398 | 2018 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Kernels by properly colored paths in arc-colored digraphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
A kernel by properly colored paths of an arc-colored digraph D is a set S of vertices of D such that (i) no two vertices of S are connected by a properly colored directed path in D, and (ii) every vertex outside S can reach S by a properly colored directed path in D. In this paper, we conjecture that every arc-colored digraph with all cycles properly colored has such a kernel and verify the conjecture for digraphs with no intersecting cycles, semi-complete digraphs and bipartite tournaments, respectively. Moreover, weaker conditions for the latter two classes of digraphs are given.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 341, Issue 6, June 2018, Pages 1523-1533
Journal: Discrete Mathematics - Volume 341, Issue 6, June 2018, Pages 1523-1533
نویسندگان
Yandong Bai, Shinya Fujita, Shenggui Zhang,