A {\em weak signed total Italian dominating function} (WSTIDF) of a graph with vertex set is defined as a function having the property that for each , where is the neighborhood of . The weight of a WSTIDF is the sum of its function values over all vertices. The {\em weak signed total Italian domination number} of , denoted by , is the minimum weight of a WSTIDF in . We initiate the study of the weak signed total Italian domination number, and we present different sharp bounds on . 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