%0 Journal Article
%T Weak signed Roman domination in graphs
%J Communications in Combinatorics and Optimization
%I Azarbaijan Shahid Madani University
%Z 2538-2128
%A Volkmann, Lutz
%D 2020
%\ 12/01/2020
%V 5
%N 2
%P 111-123
%! Weak signed Roman domination in graphs
%K domination
%K signed Roman domination
%K weak signed Roman domination
%R 10.22049/cco.2019.26598.1123
%X A {em weak signed Roman dominating function} (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as afunction $f:V(G)rightarrow{-1,1,2}$ having the property that $sum_{xin N[v]}f(x)ge 1$ for each $vin V(G)$, where $N[v]$ is theclosed 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 $gamma_{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 $gamma_{wsR}(G)$.In addition, we determine the weak signed Roman domination number of some classes of graphs.
%U http://comb-opt.azaruniv.ac.ir/article_13989_25818cd686d936e0f57852d8ce1b4284.pdf