The k-rainbow reinforcement numbers in graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 975422 (Why is no real title available?)
- Bounds on the 2-rainbow domination number of graphs
- General bounds on rainbow domination numbers
- On domination and reinforcement numbers in trees
- On the 2-rainbow domination in graphs
- On the complexity of the bondage and reinforcement problems
- Rainbow domination in graphs
- Rainbow domination on trees
- The \(k\)-rainbow domatic number of a graph
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
Cited in
(12)- Double Roman reinforcement number in graphs
- On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
- Restrained Italian reinforcement number in graphs
- Total k-rainbow reinforcement number in graphs
- Restrained k-rainbow reinforcement number in graphs
- Quasi-total Roman reinforcement in graphs
- Italian domination in the Cartesian product of paths
- The restrained \(k\)-rainbow reinforcement number of graphs
- Reinforcement number of a graph with respect to half-domination
- RESTRAINED ROMAN REINFORCEMENT NUMBER IN GRAPHS
- Rainbow reinforcement numbers in digraphs
- Rainbow domination in graphs
This page was built for publication: The \(k\)-rainbow reinforcement numbers in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516871)