Learn More
For a positive integer k, a k-rainbow dominating function of a graph G is a function f from the vertex set V (G) to the set of all subsets of the set {1, 2,. .. , k} such that for any vertex v ∈ V (G) with f (v) = ∅ the condition u∈N (v) f (u) = {1, 2,. .. , k} is fulfilled, where N (v) is the neighborhood of v. The 1-rainbow domination is the same as the(More)
A set D ⊆ V of vertices is said to be a (connected) distance k-dominating set of G if the distance between each vertex u ∈ V − D and D is at most k (and D induces a connected graph in G). The minimum cardinality of a (connected) distance k-dominating set in G is the (connected) distance k-domination number of G, denoted by γ k (G) (γ c k (G), respectively).(More)
A subset D of the vertex set of a graph G is a (k, p)-dominating set if every vertex v ∈ V (G) \ D is within distance k to at least p vertices in D. The parameter γ k,p (G) denotes the minimum cardinality of a (k, p)-dominating set of G. In 1994, Bean, Henning and Swart posed the conjecture that γ k,p (G) ≤ p p+k n(G) for any graph G with δ k (G) ≥ k + p −(More)