The 3-Rainbow Domination Number of the Cartesian Product of Cycles

Abstract

We have studied the k-rainbow domination number of C n □ C m for k ≥ 4 (Gao et al. 2019), in which we present the 3-rainbow domination number of C n □ C m , which should be bounded above by the four-rainbow domination number of C n □ C m . Therefore, we give a rough bound on the 3-rainbow domination number of C n □ C m . In this paper, we focus on the 3-rainbow domination number of the Cartesian product of cycles, C n □ C m . A 3-rainbow dominating function (3RDF) f on a given graph G is a mapping from the vertex set to the power set of three colors { 1 , 2 , 3 } in such a way that every vertex that is assigned to the empty set has all three colors in its neighborhood. The weight of a 3RDF on G is the value ω ( f ) = ∑ v ∈ V ( G ) | f ( v ) | . The 3-rainbow domination number, γ r 3 ( G ) , is the minimum weight among all weights of 3RDFs on G. In this paper, we determine exact values of the 3-rainbow domination number of C 3 □ C m and C 4 □ C m and present a tighter bound on the 3-rainbow domination number of C n □ C m for n ≥ 5 .