On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
From MaRDI portal
Publication:4957573
DOI10.22049/cco.2021.27067.1188zbMath1488.05371OpenAlexW3164662782MaRDI QIDQ4957573
Publication date: 9 September 2021
Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_14166_529748fc23cb8af458c78bcc4dcc2d3a.pdf
Cartesian product2-rainbow domination number2-rainbow dominating functionouter independent 2-rainbow dominating functionouter independent 2-rainbow domination number
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
Cites Work
- Unnamed Item
- Unnamed Item
- Bounds on the 2-rainbow domination number of graphs
- The \(k\)-rainbow bondage number of a graph
- On rainbow domination numbers of graphs
- The \(k\)-rainbow reinforcement numbers in graphs
- Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph
- Rainbow domination in graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Rainbow domination on trees
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- On the 2-rainbow domination in graphs
- On the rainbow domination subdivision numbers in graphs
- The k-rainbow domatic number of a graph
- Total $k$-Rainbow domination numbers in graphs
- The restrained rainbow bondage number of a graph