2020/11/02 by van Bommel, Christopher M.
#05C69 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2011.01078
An Italian dominating function on a (di)graph G with vertex set V(G) is a function f: V(G) → \0, 1, 2\ such that every vertex v ∈ V(G) such that f(v) = 0 has an (in)neighbour assigned 2 or two (in)neighbours assigned 1. We complete the investigation of the Italian domination numbers of Cartesian products of directed cycles.