Roman \2 \-domination
From MaRDI portal
Publication:266795
DOI10.1016/J.DAM.2015.11.013zbMATH Open1333.05217OpenAlexW2202070217MaRDI QIDQ266795FDOQ266795
Authors: Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- 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
- On 2-rainbow domination and roman domination in graphs
- Weak Roman domination in graphs
- Bounds on the 2-rainbow domination number of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Few compare to the great Roman Empire
- Bounds on weak Roman and 2-rainbow domination numbers
- Rainbow domination in graphs
- Note on 2-rainbow domination and Roman domination in graphs
Cited In (only showing first 100 items - show all)
- On perfect Roman domination number in trees: complexity and bounds
- On the double Roman domination of graphs
- The Roman domatic problem in graphs and digraphs: a survey
- On the double Roman domination in graphs
- Italian domination on Mycielskian and Sierpinski graphs
- Italian domination and perfect Italian domination on Sierpiński graphs
- On the outer-independent double Italian domination number
- From Italian domination in lexicographic product graphs to \(w\)-domination in graphs
- Title not available (Why is that?)
- Italian domination in rooted product graphs
- Covering Italian domination in graphs
- Algorithmic results on double Roman domination in graphs
- Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs
- Total Roman \(\{2\}\)-domination in graphs
- Trees with equal Roman \{2\}-domination number and independent Roman \{2\}-domination number
- On the Italian reinforcement number of a digraph
- Italian domination in the Cartesian product of paths
- Secure Italian domination in graphs
- Global italian domination in graphs
- A note on the bounds of Roman domination numbers
- Italian domination of Cartesian products of directed cycles
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs
- Bounds on the outer-independent double Italian domination number
- Total Roman \(\{2\}\)-reinforcement of graphs
- A Nordhaus-Gaddum bound for Roman domination
- Triple Roman domination in graphs
- Total Roman \(\{2\}\)-dominating functions in graphs
- Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number
- A new upper bound for the perfect Italian domination number of a tree
- Total protection of lexicographic product graphs
- Restrained double Italian domination in graphs
- The Roman \(\{2 \}\)-domatic number of graphs
- Graphs with large Italian domination number
- SOFSEM 2006: Theory and Practice of Computer Science
- Bounds on the double Italian domination number of a graph
- Perfect Italian domination in graphs: complexity and algorithms
- Roman \(\{ 3 \}\)-domination (double Italian domination)
- Perfect Italian domination on planar and regular graphs
- Algorithmic aspects of Roman graphs
- On the Roman \(\{2\}\)-domatic number of graphs
- Outer independent Roman dominating functions in graphs
- Further results on the signed Italian domination
- Perfect Italian domination in cographs
- Constructive characterizations concerning weak Roman domination in trees
- Domination parameters with number 2: interrelations and algorithmic consequences
- Perfect Roman domination in graphs
- Varieties of Roman Domination
- Bounds on the locating Roman domination number in trees
- Roman \(\{2\}\)-domination problem in graphs
- Rainbow domination in graphs
- Independent Roman \(\{2 \}\)-domination in graphs
- Weak \(\{2\}\)-domination number of Cartesian products of cycles
- Restrained Roman and restrained Italian domatic numbers of graphs
- On the total Roman domination in trees
- Perfect Italian domination in trees
- Relating the annihilation number and the 2-domination number of block graphs
- On two open problems concerning weak Roman domination in trees
- A characterization of trees with equal Roman 2-domination and Roman domination numbers
- Italian domination in trees
- On the independent double Roman domination in graphs
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs
- Independent double Roman domination in graphs
- On the co-Roman domination in graphs
- Varieties of Roman domination. II
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Approximation algorithm for the minimum partial connected Roman dominating set problem
- Perfect double Italian domination of a graph
- Restrained Italian reinforcement number in graphs
- An upper bound on the total Roman \(\{2\}\)-domination number of graphs with minimum degree two
- On the total restrained double Italian domination
- Isolate Roman domination in graphs
- On computing secure domination of trees
- On the computational complexity of Roman\(\{2\}\)-domination in grid graphs
- Integer linear programming formulations for double Roman domination problem
- From the strong differential to Italian domination in graphs
- New complexity results on Roman {2}-domination
- Independent Italian bondage of graphs
- Roman domination number of signed graphs
- Restrained Italian bondage number in graphs
- On the total version of the covering Italian domination problem
- Starred Italian domination in graphs
- Perfect Italian domination number of graphs
- Roman domination in signed graphs
- Roman {2}-domination in Graphs and Graph Products
- Independent Roman \(\{3\}\)-domination
- Total Italian domatic number of graphs
- Regular graphs with large Italian domatic number
- From \(w\)-domination in graphs to domination parameters in lexicographic product graphs
- Outer independent double Italian domination: Complexity, characterization
- Complexity aspects of variants of independent Roman domination in graphs
- Roman \(\{2\}\)-bondage number of a graph
- EDGE ITALIAN DOMINATION OF SOME GRAPH PRODUCTS
- Unique response Roman domination: complexity and algorithms
- Domination-related parameters in middle graphs
- The Italian domination numbers of some generalized Sierpiński networks
- Approximation algorithm for (connected) Italian dominating function
- Algorithmic aspects of total Roman ${2}$-domination in graphs
- Domination parameters of generalized Sierpiński graphs
- Bounds on the co-Roman domination number in graphs
- Title not available (Why is that?)
This page was built for publication: Roman \(\{2 \}\)-domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266795)
