کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6876226 | 689735 | 2014 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On pairwise compatibility graphs having Dilworth number two
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: On pairwise compatibility graphs having Dilworth number two On pairwise compatibility graphs having Dilworth number two](/preview/png/6876226.png)
چکیده انگلیسی
It is known that LPGâ©mLPG is not empty and that threshold graphs, i.e. Dilworth one graphs, are contained in it. In this paper we prove that Dilworth two graphs belong to the set LPGâ©mLPG, too. Our proof is constructive since we show how to compute all the parameters T, w, dmax and dmin exploiting the usual representation of Dilworth two graphs in terms of node weight function and thresholds. For graphs with Dilworth number two that are also split graphs, i.e. split permutation graphs, we provide another way to compute T, w, dmin and dmax when these graphs are given in terms of their intersection model.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 524, 6 March 2014, Pages 34-40
Journal: Theoretical Computer Science - Volume 524, 6 March 2014, Pages 34-40
نویسندگان
T. Calamoneri, R. Petreschi,