Upper bound on 3-rainbow domination in graphs with minimum degree 2
From MaRDI portal
Publication:1662645
DOI10.1016/J.DISOPT.2018.02.004zbMATH Open1506.05158OpenAlexW2795805246WikidataQ130028739 ScholiaQ130028739MaRDI QIDQ1662645FDOQ1662645
Masaki Koyanagi, Michitaka Furuya, Maho Yokota
Publication date: 20 August 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2018.02.004
Recommendations
Cites Work
- Title not available (Why is that?)
- Difference between 2-rainbow domination and roman domination in graphs
- On the 2-rainbow domination in graphs
- On 2-rainbow domination and roman domination in graphs
- Bounds on the 2-rainbow domination number of graphs
- Domination-balanced graphs
- Bounds on weak Roman and 2-rainbow domination numbers
- Rainbow domination in graphs
- Note on 2-rainbow domination and Roman domination in graphs
- Title not available (Why is that?)
- Domination in graphs with minimum degree two
- Rainbow domination on trees
- On graphs having domination number half their order
- The \(k\)-rainbow domatic number of a graph
- On rainbow domination numbers of graphs
- General bounds on rainbow domination numbers
- Some results on Vizing's conjecture and related problems
- A note on total domination and 2-rainbow domination in graphs
Cited In (7)
- Title not available (Why is that?)
- A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two
- Rainbow Domination in Graphs
- Title not available (Why is that?)
- On \(k\)-rainbow domination in regular graphs
- Independent k -rainbow bondage number of graphs
- Rainbow domination in Cartesian product of paths and cycles
This page was built for publication: Upper bound on 3-rainbow domination in graphs with minimum degree 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662645)
