On 2-rainbow domination of generalized Petersen graphs

摘要

Let gamma(r2) (G) be the 2-rainbow domination number of a graph G. In our work, we solve an open question for 2-rainbow domination number of general Petersen graphs P(n, k). In addition, we proved that gamma(r2)(P(n, k)) = n for n <= 12, gamma(r2) (P(n, 1)) = n for n >= 5, and gamma(r2)(P(2k + 2, k)) = 2k + 2 for k >= 2. (C) 2018 Elsevier B.V. All rights reserved.