On the signed Roman k-domination in graphs

Abstract

Let k ≥ 1 be an integer and G be a simple and finite graph with vertex set V (G). A signed Roman k-dominating function (SRkDF) on a graph G is a function f : V (G) → {−1, 1, 2} such that (i) every vertex v with f (v) = −1 is adjacent to at least one vertex u with f (u) = 2, (ii) Σ _{u ϵN [v]} f (u) ≥ k holds for any vertex v. The weight of a SRkDF f is Σ _{uϵV (G)} f (u), and the minimum weight of a SRkDF is the signed Roman k-domination number (G) of G. In this paper, we investigate the (G) signed Roman k-domination number of graphs, and we establish some bounds on (G). In the case that T is a tree, we present lower and upper bounds on (T ) for k ∈ {3, 4} and classify all extremal trees.