The Italian domination numbers of some products of directed cycles
Abstract: An Italian dominating function on a digraph $D$ with vertex set $V(D)$ is defined as a function $f : V(D) \rightarrow {0, 1, 2}$ such that every vertex $v \in V(D)$ with $f(v) = 0$ has at least two in-neighbors assigned $1$ under $f$ or one in-neighbor $w$ with $f(w) = 2$. In this paper, we determine the exact values of the Italian domination numbers of some products of directed cycles.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.