Abstract By suitably adjusting the tropical algebra technique we compute rainbow independent domination numbers of several infinite families graphs including Cartesian products $$C_n \Box P_m$$ C n ? P m </mm...

Assume we have a set of k colors and we assign an arbitrary subset of these colors to each vertex of a graph G. If we require that each vertex to which an empty set is assigned has in its neighborhood all k colors, then this assignment is called a k-rainbow dominating function of G. The corresponding invariant γrk(G), which is the minimum sum of numbers of assigned colors over all vertices of G...