English

On the total Italian domination number in digraphs

Combinatorics 2025-08-19 v2

Abstract

Consider a finite simple digraph DD with vertex set V(D)V(D). An Italian dominating function (IDF) on DD is a function f:V(D){0,1,2}f:V(D)\rightarrow\{0,1,2\} satisfying every vertex uu with f(u)=0f(u)=0 has an in-neighbor vv with f(v)=2f(v)=2 or two in-neighbors ww and zz with f(w)=f(z)=1f(w)=f(z)=1. A total Italian dominating function (TIDF) on DD is an IDF ff such that the subdigraph D[{uf(u)1}]D[\{ u\, |\, f(u)\ge 1\}] contains no isolated vertices. The weight ω(f)\omega(f) of a TIDF ff on DD is uV(D)f(u)\sum_{u\in V(D)}f(u). The total Italian domination number of DD is \gamma_{tI}(D)=\min\{ \omega(f)\, |\, \mbox{fisaTIDFon is a TIDF on D}\}. In this paper, we present bounds on γtI(D)\gamma_{tI}(D), and investigate the relationship between several different domination parameters. In particular, we give the total Italian domination number of the Cartesian products P2PnP_2\Box P_n and P3PnP_3\Box P_n, where PnP_n represents a dipath with nn vertices.

Keywords

Cite

@article{arxiv.2406.17368,
  title  = {On the total Italian domination number in digraphs},
  author = {Changchang Dong and Yubao Guo and Mei Lu and Lutz Volkmann},
  journal= {arXiv preprint arXiv:2406.17368},
  year   = {2025}
}

Comments

There is a problem with one of the results in the article and it needs to be revised: the total Italian domination number of the Cartesian products $P_3\Box P_n$