A {\em weak signed total Italian dominating function} (WSTIDF) of a graph $G$ with vertex set $V(G)$ is defined as a function $f:V(G)\rightarrow\{-1,1,2\}$ having the property that $\sum_{x\in N(v)}f(x)\ge 1$ for each $v\in V(G)$, where $N(v)$ is the neighborhood of $v$. The weight of a WSTIDF is the sum of its function values over all vertices. The {\em weak signed total Italian domination number} of $G$, denoted by $\gamma_{wstI}(G)$, is the minimum weight of a WSTIDF in $G$. We initiate the study of the weak signed total Italian domination number, and we present different sharp bounds on $\gamma_{wstI}(G)$. In addition, we determine the weak signed total Italian domination number of some classes of graphs.
Volkmann, L. (2025). Weak signed total Italian domination in graphs. Communications in Combinatorics and Optimization, (), -. doi: 10.22049/cco.2025.30397.2451
MLA
Volkmann, L. . "Weak signed total Italian domination in graphs", Communications in Combinatorics and Optimization, , , 2025, -. doi: 10.22049/cco.2025.30397.2451
HARVARD
Volkmann, L. (2025). 'Weak signed total Italian domination in graphs', Communications in Combinatorics and Optimization, (), pp. -. doi: 10.22049/cco.2025.30397.2451
CHICAGO
L. Volkmann, "Weak signed total Italian domination in graphs," Communications in Combinatorics and Optimization, (2025): -, doi: 10.22049/cco.2025.30397.2451
VANCOUVER
Volkmann, L. Weak signed total Italian domination in graphs. Communications in Combinatorics and Optimization, 2025; (): -. doi: 10.22049/cco.2025.30397.2451