The Cartesian product of cycles with small 2-rainbow domination number
From MaRDI portal
Publication:498440
DOI10.1007/S10878-013-9658-0zbMath1321.05191OpenAlexW2028406846WikidataQ59407633 ScholiaQ59407633MaRDI QIDQ498440
Zofia Stȩpień, Lucjan Szymaszkiewicz, Maciej Zwierzchowski
Publication date: 28 September 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9658-0
Related Items (4)
Weak \(\{2\}\)-domination number of Cartesian products of cycles ⋮ A note on the no-three-in-line problem on a torus ⋮ Rainbow Domination in Graphs ⋮ 2-rainbow domination stability of graphs
Cites Work
- Bounds on the 2-rainbow domination number of graphs
- Rainbow domination in graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Note on 2-rainbow domination and Roman domination in graphs
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- Rainbow domination in the lexicographic product of graphs
- On the 2-rainbow domination in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Cartesian product of cycles with small 2-rainbow domination number
