%0 Journal Article
%T Signed total Italian domination in digraphs
%J Communications in Combinatorics and Optimization
%I Azarbaijan Shahid Madani University
%Z 2538-2128
%A Volkmann, Lutz
%D 2023
%\ 09/01/2023
%V 8
%N 3
%P 457-466
%! Signed total Italian domination in digraphs
%K digraph
%K Signed total Italian domination number
%K signed total Roman domination number
%R 10.22049/cco.2022.27700.1318
%X Let $D$ be a finite and simple digraph with vertex set $V(D)$. A signed total Italian dominating function (STIDF) on a digraph $D$ is a function $f:V(D)\rightarrow\{-1,1,2\}$ satisfying the conditions that (i) $\sum_{x\in N^-(v)}f(x)\ge 1$ for each $v\in V(D)$, where $N^-(v)$ consists of all vertices of $D$ from which arcs go into $v$, and (ii) every vertex $u$ for which $f(u)=-1$ has an in-neighbor $v$ for which $f(v)=2$ or two in-neighbors $w$ and $z$ with $f(w)=f(z)=1$. The weight of an STIDF $f$ is $\sum_{v\in V(D)}f(v)$. The signed total Italian domination number $\gamma_{stI}(D)$ of $D$ is the minimum weight of an STIDF on $D$. In this paper we initiate the study of the signed total Italian domination number of digraphs, and we present different bounds on $\gamma_{stI}(D)$. In addition, we determine the signed total Italian domination number of some classes of digraphs.
%U http://comb-opt.azaruniv.ac.ir/article_14408_17d0e8e2890d7e5de888e48b939c4e2e.pdf