کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9514559 | 1632609 | 2005 | 5 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Paired-domination of Cartesian products of graphs and rainbow domination
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Paired-domination of Cartesian products of graphs and rainbow domination Paired-domination of Cartesian products of graphs and rainbow domination](/preview/png/9514559.png)
چکیده انگلیسی
The most famous open problem involving domination in graphs is Vizing's conjecture which states the domination number of the Cartesian product of any two graphs is at least as large as the product of their domination numbers. We investigate a similar problem for paired-domination, and obtain a lower bound in terms of product of domination number of one factor and 3-packing of the other factor. Some results are obtained by applying a new graph invariant called rainbow domination.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 22, 15 October 2005, Pages 233-237
Journal: Electronic Notes in Discrete Mathematics - Volume 22, 15 October 2005, Pages 233-237
نویسندگان
Boštjan Brešar, Michael A. Henning, Douglas F. Rall,