Independent Roman \2 \-domination in graphs

DOI10.1016/J.DAM.2017.10.028MaRDI QIDQ1693166zbMATH OpenOpenAlexFDO

Authors Abdelkader Rahmouni, Mustapha Chellali

Publication date 11 January 2018

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

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

zbMATH Keywords

independent 2-rainbow dominationindependent Roman \(\{2 \}\)-dominationindependent Roman domination

Mathematics Subject Classification ID

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

Recommendations

• On the independent double Roman domination in graphs
• Independent double Roman domination in graphs
• Independent double Roman domination in graphs
• Further results on the independent Roman domination number of graphs
• Note on the independent Roman domination number of a graph
• Independent Roman domination and 2-independence in trees
• Independent \((1, 2)\)-domination in graphs
• Properties of independent Roman domination in graphs
• Total Roman \(\{2\}\)-domination in graphs
• Outer-independent total Roman domination in graphs

Cites work

• Bounds on the 2-rainbow domination number of graphs
• Bounds on weak Roman and 2-rainbow domination numbers
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Defending the Roman Empire---a new strategy
• Few compare to the great Roman Empire
• Independent 2-rainbow domination in graphs
• Note on 2-rainbow domination and Roman domination in graphs
• On 2-rainbow domination and roman domination in graphs
• On the 2-rainbow domination in graphs
• On the well-coveredness of Cartesian products of graphs
• Rainbow domination in graphs
• Rainbow domination in the lexicographic product of graphs
• Roman \(\{2 \}\)-domination
• Roman domination in graphs.

Cited in

(23)

• Independent double Roman domination in graphs
• Roman \([1,2]\)-domination of graphs
• Roman \(\{2 \}\)-domination
• Isolate Roman domination in graphs
• On the Italian reinforcement number of a digraph
• Italian domination in the Cartesian product of paths
• A note on the independent Roman domination in unicyclic graphs
• Trees with equal Roman \{2\}-domination number and independent Roman \{2\}-domination number
• Independent Italian bondage of graphs
• Algorithmic and complexity aspects of problems related to total Roman domination for graphs
• Starred Italian domination in graphs
• Total Roman \(\{2\}\)-reinforcement of graphs
• Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number
• Graphs with large Italian domination number
• Independent Roman \(\{3\}\)-domination
• Complexity aspects of variants of independent Roman domination in graphs
• Further results on the independent Roman domination number of graphs
• Varieties of Roman Domination
• Roman \(\{2\}\)-domination problem in graphs
• Rainbow domination in graphs
• On the independent double Roman domination in graphs
• Roman domination and independent Roman domination on graphs with maximum degree three
• Outer-independent total Roman domination in graphs

This page was built for publication: Independent Roman \(\{2 \}\)-domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1693166)