Generalized 3-rainbow domination in graphs and honeycomb system \((\mathrm{HC}(n))\) (Q6561532)

A variant of the rainbow domination concept in graphs is introduced. A function that assigns a subset of \(\{1,2,3\}\) to each vertex of the graph is called generalized 3-rainbow dominating if \(\bigcup_{u\in N[v]} f(u)=\{1,2,3\}\) for all vertices \(v\), where \(N[v]\) is the closed neighbourhood of the vertex \(v\). The exact value of the generalized 3-rainbow domination number is determined for some graph classes (complete graphs, stars, paths, cycles, one specific class of trees, and the class of honeycomb structures) and upper bounds are given for generalized Petersen graphs \(\mathrm{GP}(n,2)\) and \(\mathrm{GP}(n,3)\). The proofs are short and trivial.