On 2-rainbow domination and roman domination in graphs
From MaRDI portal
Publication:2848725
zbMATH Open1278.05168MaRDI QIDQ2848725FDOQ2848725
Authors: Mustapha Chellali, Nader Jafari Rad 
Publication date: 26 September 2013
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
Recommendations
- Note on 2-rainbow domination and Roman domination in graphs
- On the 2-rainbow domination in graphs
- On the 2-rainbow domination stable graphs
- A note on total domination and 2-rainbow domination in graphs
- Total Roman \(\{2\}\)-domination in graphs
- Bounds on the 2-rainbow domination number of graphs
- Roman \(\{2\}\)-domination problem in graphs
- Roman domination on 2-connected graphs
- On rainbow domination numbers of graphs
- scientific article; zbMATH DE number 7589547
Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (37)
- Title not available (Why is that?)
- Averaging 2-rainbow domination and Roman domination
- Roman \(\{2 \}\)-domination
- Bounds on the 2-rainbow domination number of graphs
- 2-rainbow domination stability of 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
- On 2-rainbow domination number of functigraph and its complement
- Note on 2-rainbow domination and Roman domination in graphs
- Further results on outer independent 2-rainbow dominating functions of graphs
- Difference between 2-rainbow domination and roman domination in graphs
- A note on total domination and 2-rainbow domination in graphs
- On the 2-rainbow domination stable graphs
- Independent 2-rainbow domination in graphs
- Relating 2-rainbow domination to Roman domination
- Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number
- Bounding the rainbow domination number of a tree in terms of its annihilation number
- Rainbow domination in the lexicographic product of graphs
- The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs
- Independent 2-rainbow domination in trees
- Graphs with large total 2-rainbow domination number
- Total 2-rainbow domination in graphs: complexity and algorithms
- Maximal 2-rainbow domination number of a graph
- A note on the 2-rainbow bondage numbers in graphs
- The Roman domination number of some special classes of graphs - convex polytopes
- Rainbow edge domination numbers in graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- Relating 2-rainbow domination to weak Roman domination
- Rainbow domination in graphs
- Independent Roman \(\{2 \}\)-domination in graphs
- Roman domination in graphs
- Upper bound on 3-rainbow domination in graphs with minimum degree 2
- On the rainbow domination subdivision numbers in graphs
- Italian, 2-rainbow and Roman domination numbers in middle graphs
- Further results on maximal rainbow domination number
- Total \(k\)-rainbow domination numbers in graphs
This page was built for publication: 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 Q2848725)
