Italian Domination Number of Strong Product of Cycles.

The investigation into the domination problem and the associated subset problem of graphs is a focal point in graph theory research, sparking widespread interest and extensive exploration. This paper mainly studies the Italian domination of the strong product of two cycles. By constructing recursive Italian dominating functions, a well-defined bound for the Italian domination number in Cn Cm is obtained. Furthermore, through mathematical derivation and proof, the precise Italian domination number of C3 Cm is determined. [ABSTRACT FROM AUTHOR]