TY - JOUR ID - 14166 TI - On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles JO - Communications in Combinatorics and Optimization JA - CCO LA - en SN - 2538-2128 AU - Dehgardi, Nasrin AD - Sirjan University of Technology, Sirjan 78137, Iran Y1 - 2021 PY - 2021 VL - 6 IS - 2 SP - 315 EP - 324 KW - 2-rainbow dominating function‎ KW - ‎2-rainbow domination number‎ KW - ‎outer independent 2-rainbow dominating function‎ KW - ‎outer independent 2-rainbow domination number‎ KW - ‎C‎artesian product DO - 10.22049/cco.2021.27067.1188 N2 - Let $G$ be a graph. A  $2$-rainbow dominating function (or {\em 2-RDF}) of $G$ is a function $f$ from $V(G)$ to the set of all subsets of the set $\{1,2\}$ such that for a vertex $v\in V(G)$ with $f(v)=\emptyset$, the condition $\bigcup_{u\in N_{G}(v)}f(u)=\{1,2\}$ is fulfilled, where $N_{G}(v)$ is the open neighborhood of $v$. The weight of 2-RDF $f$ of $G$ is the value $\omega (f):=\sum _{v\in V(G)}|f(v)|$. The {\em $2$-rainbow domination number} of $G$, denoted by $\gamma_{r2}(G)$, is the minimum weight of a 2-RDF of $G$. A 2-RDF $f$ is called an  outer independent $2$-rainbow dominating function (or  OI2-RDF} of $G$ if the set of all $v\in V(G)$ with $f(v)=\emptyset$ is an independent set. The outer independent $2$-rainbow domination number $\gamma_{oir2}(G)$ is the minimum weight of an OI2-RDF of $G$. In this paper, we obtain the outer independent $2$-rainbow domination number of $P_{m}\square P_{n}$ and $P_{m}\square C_{n}$. Also we determine the value of $\gamma_{oir2}(C_{m}\Box C_{n})$ when $m$ or $n$ is even.  UR - http://comb-opt.azaruniv.ac.ir/article_14166.html L1 - http://comb-opt.azaruniv.ac.ir/article_14166_529748fc23cb8af458c78bcc4dcc2d3a.pdf ER -