نتایج جستجو برای: 2 rainbow domination
تعداد نتایج: 2539287 فیلتر نتایج به سال:
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 vertex v ∈ V with f(v) = ∅ the condition ⋃ u∈N(v) f(u) = {1, 2, . . . , k} is fulfilled, where N(v) is the set of in-neighbors of v. The weight of a kRDF f is the value ω(f) = ∑ v∈V |f(v...
Let f be a function that assigns to each vertex a subset of colors chosen from a set C = {1, 2, . . . , k} of k colors. If u∈N(v) f (u) = C for each vertex v ∈ V with f (v) = ∅, then f is called a k-rainbow dominating function (kRDF) of G where N(v) = {u ∈ V | uv ∈ E}. The weight of f , denoted by w(f ), is defined as w(f ) = v∈V |f (v)|. Given a graph G, the minimum weight among all weight...
New results on singleton rainbow domination numbers of generalized Petersen graphs P(ck,k) are given. Exact values established for some infinite families, and lower upper bounds with small gaps given in all other cases.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید