A new upper bound on the independent 2-rainbow domination number in trees
From MaRDI portal
Publication:6155871
DOI10.22049/CCO.2022.27641.1305zbMATH Open1524.05212MaRDI QIDQ6155871FDOQ6155871
Authors: R. Jafari, Abolfazl Tehranian, Hamid Rasouli 
Publication date: 7 June 2023
Recommendations
- Independent 2-rainbow domination in trees
- Independent 2-rainbow domination in graphs
- Bounds on the 2-rainbow domination number of graphs
- Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
- A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- On the 2-rainbow domination in graphs
- Rainbow domination in graphs
- Total \(k\)-rainbow domination numbers in graphs
- Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
- Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs
- On \(k\)-rainbow independent domination in graphs
- Independent rainbow domination of graphs
- Independent 2-rainbow domination in graphs
- Independent 2-rainbow domination in trees
- Graphs with large total 2-rainbow domination number
- Total 2-rainbow domination numbers of trees
- Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
- On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
Cited In (2)
This page was built for publication: A new upper bound on the independent 2-rainbow domination number in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155871)
