%0 Journal Article
%T Bounds on signed total double Roman domination
%J Communications in Combinatorics and Optimization
%I Azarbaijan Shahid Madani University
%Z 2538-2128
%A Shahbazi, L.
%A Abdollahzadeh Ahangar, H.
%A Khoeilar, R.
%A Sheikholeslami, Seyed Mahmoud
%D 2020
%\ 12/01/2020
%V 5
%N 2
%P 191-206
%! Bounds on signed total double Roman domination
%K Roman domination
%K signed double Roman domination
%K signed total double Roman domination
%R 10.22049/cco.2020.26761.1140
%X 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.
%U http://comb-opt.azaruniv.ac.ir/article_14061_e11b84bc918c5f13db5dfa4080bc9852.pdf