Note on 2-rainbow domination and Roman domination in graphs
From MaRDI portal
Publication:972956
DOI10.1016/J.AML.2010.02.012zbMATH Open1213.05199OpenAlexW1987743836MaRDI QIDQ972956FDOQ972956
Publication date: 21 May 2010
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2010.02.012
Recommendations
- On 2-rainbow domination and roman domination in graphs
- A note on total domination and 2-rainbow domination in graphs
- On the 2-rainbow domination in graphs
- A note on Roman \(\{2\}\)-domination in digraphs.
- A note on \(2\)-rainbow domination number of digraphs.
- Total Roman \(\{2\}\)-domination in graphs
- On the 2-rainbow domination stable graphs
- A note on Roman domination in graphs
- A note on Roman domination in graphs
- Difference between 2-rainbow domination and roman domination in graphs
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Roman domination in graphs.
- On the 2-rainbow domination in graphs
- Rainbow domination in graphs
- Title not available (Why is that?)
- On the Roman domination number of a graph
- A note on Roman domination in graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- On dominating the Cartesian product of a graph and K2
Cited In (27)
- On the k-rainbow domination in graphs with bounded tree-width
- Averaging 2-rainbow domination and Roman domination
- Roman \(\{2 \}\)-domination
- Bounds on the 2-rainbow domination number of graphs
- Roman Domination in Graphs
- Total 2-rainbow domination numbers of trees
- Bounds on weak Roman and 2-rainbow domination numbers
- General upper bounds on independent \(k\)-rainbow domination
- Rainbow Domination in Graphs
- On \(k\)-rainbow independent domination in graphs
- Difference between 2-rainbow domination and roman domination in graphs
- Relating 2-rainbow domination to Roman domination
- Total $k$-Rainbow domination numbers in graphs
- The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs
- Graphs with large total 2-rainbow domination number
- Total 2-rainbow domination in graphs: complexity and algorithms
- On the complexity of reinforcement in graphs
- Bounding the \(k\)-rainbow total domination number
- On 2-rainbow domination and roman domination in graphs
- On the rainbow domination number of digraphs
- The \(l\)-distance \(k\)-rainbow domination numbers of graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- The Cartesian product of cycles with small 2-rainbow domination number
- Independent Roman \(\{2 \}\)-domination in graphs
- Extremal problems on weak Roman domination number
- Upper bound on 3-rainbow domination in graphs with minimum degree 2
- Italian, 2-rainbow and Roman domination numbers in middle graphs
This page was built for publication: Note on 2-rainbow domination and Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972956)
