Bounds on the k-tuple domatic number of a graph

Mathematica Slovaca

Lutz Volkmann¹ 

关键词: domination;    k-tuple domination;    k-tuple domatic number;   

DOI  :  10.2478/s12175-011-0052-z

学科分类：数学（综合）

来源: Slovenska Akademia Vied * Matematicky Ustav / Slovak Academy of Sciences, Mathematical Institute

【 摘 要 】

Let k be a positive integer, and let G be a simple graph with vertex set V (G). A vertex of a graph G dominates itself and all vertices adjacent to it. A subset S ⊆ V (G) is a k-tuple dominating set of G if each vertex of V (G) is dominated by at least k vertices in S. The k-tuple domatic number of G is the largest number of sets in a partition of V (G) into k-tuple dominating sets.In this paper, we present a lower bound on the k-tuple domatic number, and we establish Nordhaus-Gaddum inequalities. Some of our results extends those for the classical domatic number.

【 授权许可】

Unknown