Independent Rainbow Domination Numbers of Generalized Petersen Graphs P(n,2) and P(n,3)

2020 
We obtain new results on independent 2- and 3-rainbow domination numbers of generalized Petersen graphs P ( n , k ) for certain values of n , k ∈ N . By suitably adjusting and applying a well established technique of tropical algebra (path algebra) we obtain exact 2-independent rainbow domination numbers of generalized Petersen graphs P ( n , 2 ) and P ( n , 3 ) thus confirming a conjecture proposed by Shao et al. In addition, we compute exact 3-independent rainbow domination numbers of generalized Petersen graphs P ( n , 2 ) . The method used here is developed for rainbow domination and for Petersen graphs. However, with some natural modifications, the method used can be applied to other domination type invariants, and to many other classes of graphs including grids and tori.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    21
    References
    5
    Citations
    NaN
    KQI
    []