On 2-rainbow domination of generalized Petersen graphs
From MaRDI portal
Publication:1730265
DOI10.1016/j.dam.2018.10.027zbMath1406.05077OpenAlexW2901094222WikidataQ128882227 ScholiaQ128882227MaRDI QIDQ1730265
Xiaosong Zhang, Jia-Bao Liu, Shaohui Wang, Janez Žerovnik, Pu Wu, Zehui Shao, Huiqin Jiang
Publication date: 11 March 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.10.027
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
On the neighbor-distinguishing in generalized Petersen graphs ⋮ Rainbow domination numbers of generalized Petersen graphs ⋮ The bondage number of generalized Petersen graphs \(P(n,2)\) ⋮ Rainbow Domination in Graphs ⋮ On 2-rainbow domination number of functigraph and its complement ⋮ On \(k\)-rainbow domination in regular graphs
Cites Work
- Rainbow connection in 3-connected graphs
- 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\)
- On rainbow domination numbers of graphs
- Bounds on weak Roman and 2-rainbow domination numbers
- Rainbow domination in graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- A constructive characterization of total domination vertex critical graphs
- A note on total domination and 2-rainbow domination in graphs
- A tight upper bound for 2-rainbow domination in generalized Petersen graphs
- 2-rainbow domination number of \(C_n\square C_5\)
- On the 2-rainbow domination in graphs
- The k-rainbow domatic number of a graph
- Domination in Graphs Applied to Electric Power Networks
- Power domination with bounded time constraints
- \(k\)-power domination in block graphs
This page was built for publication: On 2-rainbow domination of generalized Petersen graphs
