On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
DOI10.22049/CCO.2021.27067.1188zbMATH Open1488.05371OpenAlexW3164662782MaRDI QIDQ4957573FDOQ4957573
Authors: N. Dehgardi
Publication date: 9 September 2021
Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_14166_529748fc23cb8af458c78bcc4dcc2d3a.pdf
Recommendations
- Further results on outer independent 2-rainbow dominating functions of graphs
- Outer independent rainbow dominating functions in graphs
- 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\)
- Independent 2-rainbow domination in graphs
- The Cartesian product of cycles with small 2-rainbow domination number
Cartesian product2-rainbow domination number2-rainbow dominating functionouter independent 2-rainbow dominating functionouter independent 2-rainbow domination number
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- On the 2-rainbow domination in graphs
- Bounds on the 2-rainbow domination number of graphs
- Rainbow domination in graphs
- Rainbow domination on trees
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- The \(k\)-rainbow domatic number of a graph
- The \(k\)-rainbow bondage number of a graph
- Title not available (Why is that?)
- Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Total \(k\)-rainbow domination numbers in graphs
- On rainbow domination numbers of graphs
- The restrained rainbow bondage number of a graph
- The \(k\)-rainbow reinforcement numbers in graphs
- On the rainbow domination subdivision numbers in graphs
Cited In (7)
- Outer independent rainbow dominating functions in graphs
- Further results on outer independent 2-rainbow dominating functions of graphs
- 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\)
- The \(l\)-distance \(k\)-rainbow domination numbers of graphs
- The Cartesian product of cycles with small 2-rainbow domination number
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957573)