Weak signed Roman domination in graphs

A weak signed Roman dominating function (WSRDF) of a graph G with vertex set V (G) is dened as a function f : V (G) ! f 1; 1; 2g having the property that P x2N[v] f(x) ≥ 1 for each v ∈ V (G), where N[v] is the closed neighborhood of v. The weight of a WSRDF is the sum of its function values over all vertices. The weak signed Roman domination number of G, denoted by wsR(G), is the minimum weight of a WSRDF in G. We initiate the study of the weak signed Roman domination number, and we present different sharp bounds on wsR(G). In addition, we determine the weak signed Roman domination number of some classes of graphs.