Dominator colorings of certain Cartesian products of paths and cycles (Q2361078)

A dominator coloring of a graph \(G\) is a proper coloring of \(G\) with the additional property that every vertex dominates an entire color class. The dominator chromatic number \(\chi_d(G)\) of \(G\) is the minimum number of colors among all dominator colorings of \(G\). The Cartesian product graph \(P_2\square P_n\) has vertex set \(V(P_2\square P_n)=\{v_1,v_2,\dots,v_n;u_1,u_2,\dots,u_n\}\) and edge set \(E(P_2\square P_n)=\{v_ iv_{i+1}:1\leq i\leq n-1\}\cup\{u_iu_{i+1}:1\leq i\leq n-1\}\cup\{u_iv_i:1\leq i\leq n\}\). We obtain \(P_2\square C_n\) from \(P_2\square P_n\) by adding two edges \(v_1v_n\) and \(u_1u_n\) to \(P_2\square P_n\). In this paper, the authors completely determine \(\chi_d(P_2\square P_n)\) (\(n\geq 2\)) and \(\chi_d(P_2\square C_n)\) (\(n\geq 3\)) by \(n\).