کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
421240 | 684163 | 2012 | 4 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On graphs for which the connected domination number is at most the total domination number
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In this note, we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number. This question is motivated by the fact that any connected dominating set of size at least 2 is in particular a total dominating set. It turns out that in this characterization, the total domination number can equivalently be substituted by the upper total domination number, the paired-domination number and the upper paired-domination number, respectively. Another equivalent condition is given in terms of structural domination.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 160, Issues 7–8, May 2012, Pages 1281–1284
Journal: Discrete Applied Mathematics - Volume 160, Issues 7–8, May 2012, Pages 1281–1284
نویسندگان
Oliver Schaudt,