On 2-Rainbow Domination Number of Generalized Petersen Graphs P(5k,k)
Open Access
Abstract
We obtain new results on 2-rainbow domination number of generalized Petersen graphs . In some cases (for some infinite families), exact values are established, and in all other cases lower and upper bounds are given. In particular, it is shown that, for , for , for , for , and for .
Keywords
This publication has 21 references indexed in Scilit:
- On 2-rainbow domination of generalized Petersen graphsDiscrete Applied Mathematics, 2019
- The 2-Rainbow Domination Numbers of ${\boldsymbol{C}}_4\Box {\boldsymbol{C}}_n$ C 4 □ C n and ${\boldsymbol{C}}_8\Box {\boldsymbol{C}}_n$ C 8 □ C nNational Academy Science Letters, 2019
- Bounds on the 2-Rainbow Domination Number of GraphsGraphs and Combinatorics, 2012
- Note on 2-rainbow domination and Roman domination in graphsApplied Mathematics Letters, 2010
- The isomorphism classes of the generalized Petersen graphsDiscrete Mathematics, 2009
- RAINBOW DOMINATION IN GRAPHSTaiwanese Journal of Mathematics, 2008
- On the domination number of the generalized Petersen graphsDiscrete Mathematics, 2008
- On the 2-rainbow domination in graphsDiscrete Applied Mathematics, 2007
- Paired-domination of Cartesian products of graphs and rainbow dominationElectronic Notes in Discrete Mathematics, 2005
- A theorem on tait colorings with an application to the generalized Petersen graphsJournal of Combinatorial Theory, 1969