Roman \(\{2 \}\)-domination
From MaRDI portal
Publication:266795
DOI10.1016/j.dam.2015.11.013zbMath1333.05217OpenAlexW2202070217MaRDI QIDQ266795
Mustapha Chellali, Alice A. McRae, Stephen T. Hedetniemi, Teresa W. Haynes
Publication date: 7 April 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.11.013
Related Items (90)
Italian domination and perfect Italian domination on Sierpiński graphs ⋮ Integer linear programming formulations for double roman domination problem ⋮ On the Italian reinforcement number of a digraph ⋮ Unnamed Item ⋮ On the outer-independent double Italian domination number ⋮ Outer independent Roman dominating functions in graphs ⋮ A note on the bounds of Roman domination numbers ⋮ A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers ⋮ On trees with equal Roman domination and outer-independent Roman domination numbers ⋮ Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number ⋮ The Roman domatic problem in graphs and digraphs: a survey ⋮ Total Roman \(\{2\}\)-dominating functions in graphs ⋮ Total protection of lexicographic product graphs ⋮ A new upper bound for the perfect Italian domination number of a tree ⋮ Unnamed Item ⋮ From Italian domination in lexicographic product graphs to w-domination in graphs ⋮ Bounds on the double Italian domination number of a graph ⋮ Perfect Italian domination in graphs: complexity and algorithms ⋮ Triple Roman domination in graphs ⋮ Perfect Italian domination in cographs ⋮ Complexity aspects of variants of independent Roman domination in graphs ⋮ On the double Roman domination in graphs ⋮ On the computational complexity of Roman\(\{2\}\)-domination in grid graphs ⋮ Total Italian domatic number of graphs ⋮ Unique response Roman domination: complexity and algorithms ⋮ Approximation algorithm for (connected) Italian dominating function ⋮ Roman \(\{ 3 \}\)-domination (double Italian domination) ⋮ From \(w\)-domination in graphs to domination parameters in lexicographic product graphs ⋮ Bounds on the locating Roman domination number in trees ⋮ Independent Roman \(\{2 \}\)-domination in graphs ⋮ Outer independent double Italian domination: Complexity, characterization ⋮ On the independent double Roman domination in graphs ⋮ Restrained Italian reinforcement number in graphs ⋮ Perfect double Italian domination of a graph ⋮ Perfect Italian domination on planar and regular graphs ⋮ Restrained Italian bondage number in graphs ⋮ Weak \(\{2\}\)-domination number of Cartesian products of cycles ⋮ Roman {2}-domination in Graphs and Graph Products ⋮ EDGE ITALIAN DOMINATION OF SOME GRAPH PRODUCTS ⋮ Graphs with small Italian domatic number ⋮ Graphs with large Italian domination number ⋮ Unnamed Item ⋮ Independent double Roman domination in graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the co-Roman domination in graphs ⋮ On the total Roman domination in trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Italian domination in rooted product graphs ⋮ The Roman \(\{2 \}\)-domatic number of graphs ⋮ Covering Italian domination in graphs ⋮ Perfect Italian domination in trees ⋮ Relating the annihilation number and the 2-domination number of block graphs ⋮ From the strong differential to Italian domination in graphs ⋮ Italian domination in trees ⋮ Algorithmic aspects of total Roman ${2}$-domination in graphs ⋮ Regular graphs with large Italian domatic number ⋮ Independent roman $\{3\}$-domination ⋮ Unnamed Item ⋮ Italian domination in the Cartesian product of paths ⋮ Secure Italian domination in graphs ⋮ Italian domination of Cartesian products of directed cycles ⋮ Roman \(\{2\}\)-bondage number of a graph ⋮ Total Roman \(\{2\}\)-reinforcement of graphs ⋮ Varieties of Roman domination II ⋮ Complexity of Roman {2}-domination and the double Roman domination in graphs ⋮ Algorithmic results on double Roman domination in graphs ⋮ Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs ⋮ Varieties of Roman Domination ⋮ Rainbow Domination in Graphs ⋮ Further results on the signed Italian domination ⋮ Algorithmic and complexity aspects of problems related to total Roman domination for graphs ⋮ Bounds on the co-Roman domination number in graphs ⋮ Total Roman {2}-domination in graphs ⋮ Global italian domination in graphs ⋮ Constructive characterizations concerning weak Roman domination in trees ⋮ Trees with equal Roman {2}-domination number and independent Roman {2}-domination number ⋮ A Nordhaus–Gaddum bound for Roman domination ⋮ Restrained Roman and restrained Italian domatic numbers of graphs ⋮ On perfect Roman domination number in trees: complexity and bounds ⋮ Perfect Roman domination in graphs ⋮ On the double Roman domination of graphs ⋮ Italian domination on Mycielskian and Sierpinski graphs ⋮ Isolate Roman domination in graphs ⋮ On the Roman {2}-domatic number of graphs ⋮ On computing secure domination of trees ⋮ ALGORITHMIC ASPECTS OF ROMAN GRAPHS ⋮ Roman \(\{2\}\)-domination problem in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on the 2-rainbow domination number of graphs
- Bounds on weak Roman and 2-rainbow domination numbers
- Rainbow domination in graphs
- Note on 2-rainbow domination and Roman domination in graphs
- Roman domination in graphs.
- Defending the Roman Empire---a new strategy
- Rainbow domination in the lexicographic product of graphs
- On the 2-rainbow domination in graphs
- Weak Roman domination in graphs
This page was built for publication: Roman \(\{2 \}\)-domination
