کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6871780 | 1440191 | 2017 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On (1,2)-step competition graphs of bipartite tournaments
ترجمه فارسی عنوان
بر روی (1،2) مرحله بازی رقابت از مسابقات دو طرفه
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
مسابقات دو طرفه، جهت کامل گراف دو طرفه، (1،2) نمودار مرحله رقابت، (1،2) مرحله مرحله رقابت قابل اجرا،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
چکیده انگلیسی
In this paper, we study (1,2)-step competition graphs of bipartite tournaments. A bipartite tournament is an orientation of a complete bipartite graph. We show that the (1,2)-step competition graph of a bipartite tournament has at most one non-trivial component or consists of exactly two complete components of size at least three and, especially in the former, the diameter of the nontrivial component is at most three if it exists. Based on this result, we show that, among the connected non-complete graphs which are triangle-free or the cycles of which are edge-disjoint, K1,4 is the only graph that can be represented as the (1,2)-step competition graph of a bipartite tournament. We also completely characterize the complete graphs and the disjoint unions of complete graphs which can be represented as the (1,2)-step competition graph of a bipartite tournament. Finally we present the maximum number of edges and the minimum number of edges which the (1,2)-step competition graph of a bipartite tournament might have.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 232, 11 December 2017, Pages 107-115
Journal: Discrete Applied Mathematics - Volume 232, 11 December 2017, Pages 107-115
نویسندگان
Jihoon Choi, Soogang Eoh, Suh-Ryung Kim, Sojung Lee,