Bounds on weak Roman and 2-rainbow domination numbers

DOI10.1016/j.dam.2014.06.016zbMath1300.05212OpenAlexW2030816276MaRDI QIDQ741531

Mustapha Chellali, Stephen T. Hedetniemi, Teresa W. Haynes

Publication date: 12 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.06.016

zbMATH Keywords

total dominationRoman domination2-domination2-rainbow dominationweak Roman dominationsecure domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (27)

Roman \(\{2 \}\)-domination ⋮ Vertex-Edge Roman Domination ⋮ Strong equality of Roman and weak Roman domination in trees ⋮ Improved integer linear programming formulation for weak Roman domination problem ⋮ Unnamed Item ⋮ Weak Roman domination in rooted product graphs ⋮ Total protection of lexicographic product graphs ⋮ Extremal problems on weak Roman domination number ⋮ Upper bound on 3-rainbow domination in graphs with minimum degree 2 ⋮ Protection of graphs with emphasis on Cartesian product graphs ⋮ Relating 2-rainbow domination to Roman domination ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Independent Roman \(\{2 \}\)-domination in graphs ⋮ Double vertex-edge domination ⋮ On 2-rainbow domination of generalized Petersen graphs ⋮ General upper bounds on independent \(k\)-rainbow domination ⋮ Relating the annihilation number and the 2-domination number of block graphs ⋮ From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs ⋮ Secure Italian domination in graphs ⋮ Varieties of Roman Domination ⋮ Rainbow Domination in Graphs ⋮ Eternal and Secure Domination in Graphs ⋮ Protection of lexicographic product graphs ⋮ Bounds on the co-Roman domination number in graphs ⋮ Constructive characterizations concerning weak Roman domination in trees ⋮ A note on total domination and 2-rainbow domination in graphs ⋮ Trees with equal total domination and 2-rainbow domination numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on the 2-rainbow domination number of graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• On domination and independent domination numbers of a graph
• A note on the k-domination number of a graph
• Rainbow domination in graphs
• Note on 2-rainbow domination and Roman domination in graphs
• Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
• Roman domination in graphs.
• Upper bounds for \(f\)-domination number of graphs
• Defending the Roman Empire---a new strategy
• Difference between 2-rainbow domination and roman domination in graphs
• Rainbow domination in the lexicographic product of graphs
• On the 2-rainbow domination in graphs
• Weak Roman domination in graphs
• Vertex Covers and Secure Domination in Graphs
• Total domination in graphs
• A new domination conception
• Total Domination in Graphs

This page was built for publication: Bounds on weak Roman and 2-rainbow domination numbers