2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
From MaRDI portal
Publication:1026161
DOI10.1016/j.dam.2009.01.020zbMath1183.05061OpenAlexW2076590268MaRDI QIDQ1026161
Chunling Tong, Meiqin Luo, Yuansheng Yang, Xiao-hui Lin
Publication date: 24 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.01.020
Related Items (35)
On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles ⋮ A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two ⋮ A new achievement from reviewing some of the content about the edge-distance-balanced property of the generalized Petersen graphs GP(4i + 7, 2) ⋮ A note on edge-distance-balanced property of the generalized Petersen graphsGP(4t, 2) ⋮ On the k-rainbow domination in graphs with bounded tree-width ⋮ Maximal 2-rainbow domination number of a graph ⋮ On the complexity of reinforcement in graphs ⋮ Bounds on the 2-rainbow domination number of graphs ⋮ 2-spanning cyclability problems of some generalized Petersen graphs ⋮ The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs ⋮ Rainbow domination numbers of generalized Petersen graphs ⋮ The \(k\)-rainbow bondage number of a graph ⋮ The bondage number of generalized Petersen graphs \(P(n,2)\) ⋮ Independent rainbow domination of graphs ⋮ The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\) ⋮ On the binary locating-domination number of regular and strongly-regular graphs ⋮ Solution to an open problem on 4-ordered Hamiltonian graphs ⋮ Rainbow reinforcement numbers in digraphs ⋮ A tight upper bound for 2-rainbow domination in generalized Petersen graphs ⋮ 2-rainbow domination number of \(C_n\square C_5\) ⋮ 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\) ⋮ On rainbow domination numbers of graphs ⋮ The Cartesian product of cycles with small 2-rainbow domination number ⋮ 2-rainbow domination in generalized petersen graphs \(P(n,3)\) ⋮ Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph ⋮ The 2-rainbow bondage number in generalized Petersen graphs ⋮ Graphs with large total 2-rainbow domination number ⋮ Unnamed Item ⋮ Rainbow Domination in Graphs ⋮ Total $k$-Rainbow domination numbers in graphs ⋮ Rainbow edge domination numbers in graphs ⋮ Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs ⋮ The restrained k-rainbow reinforcement number of graphs ⋮ Trees with equal total domination and 2-rainbow domination numbers ⋮ The \(k\)-rainbow bondage number of a digraph
Cites Work
- Rainbow domination in graphs
- Roman domination in regular graphs
- On the domination number of generalized petersen graphs \(P(n,2)\)
- The exact domination number of the generalized Petersen graphs
- On the 2-rainbow domination in graphs
- On the domination number of the generalized Petersen graphs
- Paired-domination of Cartesian products of graphs and rainbow domination
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
