@article {
author = {Shahbazi, L. and Abdollahzadeh Ahangar, H. and Khoeilar, R. and Sheikholeslami, Seyed Mahmoud},
title = {Bounds on signed total double Roman domination},
journal = {Communications in Combinatorics and Optimization},
volume = {5},
number = {2},
pages = {191-206},
year = {2020},
publisher = {Azarbaijan Shahid Madani University},
issn = {2538-2128},
eissn = {2538-2136},
doi = {10.22049/cco.2020.26761.1140},
abstract = {A signed total double Roman dominating function (STDRDF) on {an} isolated-free graph $G=(V,E)$ is a function $f:V(G)\rightarrow\{-1,1,2,3\}$ such that (i) every vertex $v$ with $f(v)=-1$ has at least two neighbors 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_{u\in N(v)}f(u)\ge1$ holds for any vertex $v$. The weight of {an} STDRDF is the value $f(V(G))=\sum_{u\in V(G)}f(u).$ The signed total double Roman domination number $\gamma^t_{sdR}(G)$ is the minimum weight of an STDRDF on $G$. In this paper, we continue the study of the signed total double Roman domination in graphs and present some sharp bounds for this parameter.},
keywords = {Roman domination,signed double Roman domination,signed total double Roman domination},
url = {http://comb-opt.azaruniv.ac.ir/article_14061.html},
eprint = {http://comb-opt.azaruniv.ac.ir/article_14061_e11b84bc918c5f13db5dfa4080bc9852.pdf}
}