TY - JOUR
ID - 14061
TI - Bounds on signed total double Roman domination
JO - Communications in Combinatorics and Optimization
JA - CCO
LA - en
SN - 2538-2128
AU - Shahbazi, L.
AU - Abdollahzadeh Ahangar, H.
AU - khoeilar, Rana
AU - Sheikholeslami, Seyed Mahmoud
AD - Azarbaijan Shahid Madani University
AD - Babol Noshirvani University of Technology
Y1 - 2020
PY - 2020
VL - 5
IS - 2
SP - 191
EP - 206
KW - Roman domination
KW - signed double Roman domination
KW - signed total double Roman domination
DO - 10.22049/cco.2020.26761.1140
N2 - A signed total double Roman dominating function (STDRDF) on {color{blue}an} isolated-free graph $G=(V,E)$ is afunction $f:V(G)rightarrow{-1,1,2,3}$ such that (i) every vertex $v$ with $f(v)=-1$ has at least twoneighbors assigned 2 under $f$ or one neighbor $w$ with $f(w)=3$, (ii) every vertex $v$ with $f(v)=1$ has at least one neighbor $w$ with $f(w)geq2$ and (iii)$sum_{uin N(v)}f(u)ge1$ holds for any vertex $v$.The weight of {color{blue}an} STDRDF is the value $f(V(G))=sum_{uin V(G)}f(u).$ The signed totaldouble Roman domination number $gamma^t_{sdR}(G)$ is the minimum weight of {color{blue}an}STDRDF on $G$. In this paper, we continue the study of the signed total double Romandomination in graphs and present some sharp bounds for this parameter.
UR - http://comb-opt.azaruniv.ac.ir/article_14061.html
L1 - http://comb-opt.azaruniv.ac.ir/article_14061_e11b84bc918c5f13db5dfa4080bc9852.pdf
ER -