Note on 2-rainbow domination and Roman domination in graphs
From MaRDI portal
Publication:972956
DOI10.1016/j.aml.2010.02.012zbMath1213.05199OpenAlexW1987743836MaRDI QIDQ972956
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
Related Items (22)
Roman \(\{2 \}\)-domination ⋮ Averaging 2-rainbow domination and Roman domination ⋮ On the k-rainbow domination in graphs with bounded tree-width ⋮ On the complexity of reinforcement in graphs ⋮ Extremal problems on weak Roman domination number ⋮ On the rainbow domination number of digraphs ⋮ Bounds on the 2-rainbow domination number of graphs ⋮ Upper bound on 3-rainbow domination in graphs with minimum degree 2 ⋮ The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs ⋮ Relating 2-rainbow domination to Roman domination ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Independent Roman \(\{2 \}\)-domination in graphs ⋮ Total 2-rainbow domination numbers of trees ⋮ General upper bounds on independent \(k\)-rainbow domination ⋮ The Cartesian product of cycles with small 2-rainbow domination number ⋮ Graphs with large total 2-rainbow domination number ⋮ Bounding the \(k\)-rainbow total domination number ⋮ Bounds on weak Roman and 2-rainbow domination numbers ⋮ Roman Domination in Graphs ⋮ Rainbow Domination in Graphs ⋮ Total $k$-Rainbow domination numbers in graphs ⋮ On \(k\)-rainbow independent domination in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on Roman domination in graphs
- Rainbow domination in graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- On the Roman domination number of a graph
- Roman domination in graphs.
- On the 2-rainbow domination in graphs
- On dominating the Cartesian product of a graph and K2
This page was built for publication: Note on 2-rainbow domination and Roman domination in graphs
