A tight upper bound for 2-rainbow domination in generalized Petersen graphs
From MaRDI portal
Publication:2446862
DOI10.1016/j.dam.2013.02.031zbMath1286.05127OpenAlexW2039597444MaRDI QIDQ2446862
Publication date: 22 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.02.031
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (10)
On the k-rainbow domination in graphs with bounded tree-width ⋮ Rainbow domination numbers of generalized Petersen graphs ⋮ The \(k\)-rainbow bondage number of a graph ⋮ Strong edge chromatic index of the generalized Petersen graphs ⋮ Weak \(\{2\}\)-domination number of Cartesian products of cycles ⋮ On 2-rainbow domination of generalized Petersen graphs ⋮ The 2-rainbow bondage number in generalized Petersen graphs ⋮ Rainbow Domination in Graphs ⋮ On \(k\)-rainbow domination in regular graphs ⋮ 2-rainbow domination stability of graphs
Cites Work
- Unnamed Item
- Rainbow domination in graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Rainbow domination on trees
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- On the 2-rainbow domination in graphs
- Paired-domination of Cartesian products of graphs and rainbow domination
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Self-dual configurations and regular graphs
This page was built for publication: A tight upper bound for 2-rainbow domination in generalized Petersen graphs