2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\)
From MaRDI portal
Publication:489721
DOI10.1007/S10878-012-9582-8zbMath1307.90191OpenAlexW2031841601WikidataQ59398997 ScholiaQ59398997MaRDI QIDQ489721
Maciej Zwierzchowski, Zofia Stȩpień
Publication date: 21 January 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9582-8
Related Items (7)
On the rainbow domination number of digraphs ⋮ Weak \(\{2\}\)-domination number of Cartesian products of cycles ⋮ 2-rainbow domination number of \(C_n\square C_5\) ⋮ On 2-rainbow domination of generalized Petersen graphs ⋮ Unnamed Item ⋮ Rainbow Domination in Graphs ⋮ On 2-rainbow domination number of functigraph and its complement
Cites Work
- Unnamed Item
- Unnamed Item
- Bounds on the 2-rainbow domination number of graphs
- Rainbow domination in graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- Dominating Cartesian products of cycles
- On the 2-rainbow domination in graphs
- On dominating the Cartesian product of a graph and K2
This page was built for publication: 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\)
