Weak \(\{2\}\)-domination number of Cartesian products of cycles
From MaRDI portal
Publication:1698059
DOI10.1007/s10878-017-0157-6zbMath1393.05201OpenAlexW2734720563MaRDI QIDQ1698059
Publication date: 21 February 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0157-6
Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
A note on the bounds of Roman domination numbers ⋮ Italian domination in the Cartesian product of paths ⋮ Italian domination of Cartesian products of directed cycles
Cites Work
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- Bounds on the 2-rainbow domination number of 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
- The Cartesian product of cycles with small 2-rainbow domination number
- On dominating sets of maximal outerplanar and planar graphs
- Rainbow domination in graphs
- Efficient algorithms for Roman domination on some classes of graphs
- On the Roman domination number of a graph
- Roman domination in graphs.
- Dominating sets in planar 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
- Extremal Problems for Roman Domination
- Domination in planar graphs with small diameter*
This page was built for publication: Weak \(\{2\}\)-domination number of Cartesian products of cycles
