The k-rainbow bondage number of a digraph
Jafar Amjadi, N. Mohammadi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann · Discussiones Mathematicae Graph Theory · 2015
Let D = (V, A) be a finite and simple digraph.A k-rainbow dominating function (kRDF) of a digraph D is a function f from the vertex set V to the set of all subsets of the set {1, 2, . . ., k} such that for any vertexIn this paper, we establish some bounds for the k-rainbow bondage number and determine the k-rainbow bondage number of several classes of digraphs.