کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
394404 665800 2010 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the k-tuple domination of generalized de Brujin and Kautz digraphs
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
On the k-tuple domination of generalized de Brujin and Kautz digraphs
چکیده انگلیسی

A vertex u in a digraph G = (V, A) is said to dominate itself and vertices v such that (u, v) ∈ A. For a positive integer k, a k-tuple dominating set of G is a subset D of vertices such that every vertex in G is dominated by at least k vertices in D. The k-tuple domination number of G is the minimum cardinality of a k-tuple dominating set of G. This paper deals with the k-tuple domination problem on generalized de Bruijn and Kautz digraphs. We establish bounds on the k-tuple domination number for the generalized de Bruijn and Kautz digraphs and we obtain some conditions for the k-tuple domination number attaining the bounds.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 180, Issue 22, 15 November 2010, Pages 4430–4435
نویسندگان
, , ,