signed total italian domination in digraphs

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) → {−1, 1, 2} satisfying the conditions that (i)∑ x∈n−(v) f(x) ≥ 1 for each v ∈ 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 inneighbors w and z with f(w) = f(z) = 1. the weight of an stidf f is∑ v∈v (d) f(v). the signed total italian domination number γ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 γsti (d). in addition, we determine the signed total italian domination number of some classes of digraphs.