Rainbow domination numbers of generalized Petersen graphs

作者：

Highlights：

• We propose an algorithm to obtain the t-rainbow domination number of P(n, 1) for any t ≥ 8 and P(2k, k) for t ≥ 6.

• We determine the t-rainbow domination number of P(n, 1) for t=4 by analyzing the structure of P(n, 1).

• The method we take is especially useful for the study of the rainbow domination number of the generalized Petersen graph.

摘要

•We propose an algorithm to obtain the t-rainbow domination number of P(n, 1) for any t ≥ 8 and P(2k, k) for t ≥ 6.•We determine the t-rainbow domination number of P(n, 1) for t=4 by analyzing the structure of P(n, 1).•The method we take is especially useful for the study of the rainbow domination number of the generalized Petersen graph.

论文关键词：Rainbow domination number,Generalized Petersen graphs

论文评审过程：Received 31 December 2019, Revised 20 April 2020, Accepted 26 April 2020, Available online 5 May 2020, Version of Record 26 May 2020.

论文官网地址：https://doi.org/10.1016/j.amc.2020.125341