set colorings of the cartesian product of some graph families

Neighbor-distinguishing colorings, which are colorings that induce a proper vertex coloring of a graph, have been the focus of different studies in graph theory. one such coloring is the set coloring. for a nontrivial graph $g$, let $c:v(g)to mathbb{n}$ and define the neighborhood color set $nc(v)$ of each vertex $v$ as the set containing the colors of all neighbors of $v$. the coloring $c$ is called a set coloring if $nc(u)neq nc(v)$ for every pair of adjacent vertices $u$ and $v$ of $g$. the minimum number of colors required in a set coloring is called the set chromatic number of $g$ and is denoted by $chi_s (g)$. in recent years, set colorings have been studied with respect to different graph operations such as join, comb product, middle graph, and total graph. continuing the theme of these previous works, we aim to investigate set colorings of the cartesian product of graphs. in this work, we investigate the gap given by $max{ chi_s(g), chi_s(h) } - chi_s(g square h)$ for graphs $g$ and $h$. in relation to this objective, we determine the set chromatic numbers of the cartesian product of some graph families.