A new upper bound on the independent 2-rainbow domination number in trees
From MaRDI portal
Publication:6155871
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
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs
- Graphs with large total 2-rainbow domination number
- Independent 2-rainbow domination in graphs
- Independent 2-rainbow domination in trees
- Independent rainbow domination of graphs
- On \(k\)-rainbow independent domination in graphs
- On the 2-rainbow domination in graphs
- On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
- Rainbow domination in graphs
- Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
- Total 2-rainbow domination numbers of trees
- Total \(k\)-rainbow domination numbers in graphs
- Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
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)
