The k-rainbow reinforcement numbers in graphs
From MaRDI portal
Publication:516871
DOI10.1016/J.DAM.2016.09.043zbMATH Open1358.05205OpenAlexW2536500162MaRDI QIDQ516871FDOQ516871
Authors: L. Asgharsharghi, Michitaka Furuya, N. Dehgardi, Lutz Volkmann, J. Amjadi, Seyed Mahmood Sheikholeslami 
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.043
Recommendations
Cites Work
- Title not available (Why is that?)
- On the 2-rainbow domination in graphs
- On domination and reinforcement numbers in trees
- Bounds on the 2-rainbow domination number of graphs
- On the complexity of the bondage and reinforcement problems
- Title not available (Why is that?)
- Rainbow domination in graphs
- Title not available (Why is that?)
- Rainbow domination on trees
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
- The \(k\)-rainbow domatic number of a graph
- General bounds on rainbow domination numbers
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)
