The restrained k-rainbow reinforcement number of graphs
From MaRDI portal
Publication:5013473
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 2142620 (Why is no real title available?)
- scientific article; zbMATH DE number 2095763 (Why is no real title available?)
- scientific article; zbMATH DE number 975422 (Why is no real title available?)
- 2-rainbow domination of generalized Petersen graphs P(n,2)
- General bounds on rainbow domination numbers
- On domination and reinforcement numbers in trees
- On the 2-rainbow domination in graphs
- On the complexity of reinforcement in graphs
- On the complexity of the bondage and reinforcement problems
- On the rainbow restrained domination number.
- Rainbow domination in graphs
- Rainbow domination on trees
- Rainbow restrained domination numbers in graphs.
- Roman reinforcement in graphs
- The k-rainbow reinforcement numbers in graphs
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
- The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
Cited in
(9)- The restrained rainbow bondage number of a graph
- Total k-rainbow reinforcement number in graphs
- Restrained k-rainbow reinforcement number in graphs
- Reinforcement number of a graph with respect to half-domination
- The k-rainbow bondage number of a graph
- Connectivity index in vague graphs with application in construction
- On the rainbow restrained domination number.
- Rainbow restrained domination numbers in graphs.
- The k-rainbow reinforcement numbers in graphs
This page was built for publication: The restrained \(k\)-rainbow reinforcement number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013473)