The following pages link to Roman \(\{2 \}\)-domination (Q266795):
Displaying 50 items.
- Independent double Roman domination in graphs (Q4956191) (← links)
- Varieties of Roman domination II (Q4956207) (← links)
- Complexity of Roman {2}-domination and the double Roman domination in graphs (Q4956233) (← links)
- ALGORITHMIC ASPECTS OF ROMAN GRAPHS (Q4956471) (← links)
- (Q4957549) (← links)
- Bounds on the co-Roman domination number in graphs (Q4985578) (← links)
- Total Roman {2}-domination in graphs (Q4986532) (← links)
- Italian domination on Mycielskian and Sierpinski graphs (Q5013489) (← links)
- On the Roman {2}-domatic number of graphs (Q5025122) (← links)
- On computing secure domination of trees (Q5025125) (← links)
- Italian domination and perfect Italian domination on Sierpiński graphs (Q5035034) (← links)
- Integer linear programming formulations for double roman domination problem (Q5038168) (← links)
- On the outer-independent double Italian domination number (Q5054034) (← links)
- From Italian domination in lexicographic product graphs to w-domination in graphs (Q5066972) (← links)
- (Q5076568) (← links)
- Independent roman $\{3\}$-domination (Q5103952) (← links)
- (Q5197584) (← links)
- Global italian domination in graphs (Q5238044) (← links)
- Trees with equal Roman {2}-domination number and independent Roman {2}-domination number (Q5242342) (← links)
- A Nordhaus–Gaddum bound for Roman domination (Q5242827) (← links)
- A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers (Q5242940) (← links)
- On trees with equal Roman domination and outer-independent Roman domination numbers (Q5242949) (← links)
- Isolate Roman domination in graphs (Q5866034) (← links)
- On the computational complexity of Roman\(\{2\}\)-domination in grid graphs (Q6043333) (← links)
- Total Italian domatic number of graphs (Q6074037) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
- Approximation algorithm for (connected) Italian dominating function (Q6090069) (← links)
- (Q6097717) (← links)
- Algorithmic aspects of total Roman ${2}$-domination in graphs (Q6101489) (← links)
- Regular graphs with large Italian domatic number (Q6101495) (← links)
- From \(w\)-domination in graphs to domination parameters in lexicographic product graphs (Q6102213) (← links)
- Outer independent double Italian domination: Complexity, characterization (Q6132230) (← links)
- (Q6150924) (← links)
- (Q6150933) (← links)
- (Q6155856) (← links)
- (Q6159868) (← links)
- Restrained Italian bondage number in graphs (Q6174745) (← links)
- Roman {2}-domination in Graphs and Graph Products (Q6187741) (← links)
- EDGE ITALIAN DOMINATION OF SOME GRAPH PRODUCTS (Q6203972) (← links)
- Outer independent total double Italian domination number (Q6546350) (← links)
- Metaheuristic algorithms for solving Roman \(\{2\}\)-domination problem (Q6550850) (← links)
- Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles (Q6550939) (← links)
- Italian, 2-rainbow and Roman domination numbers in middle graphs (Q6550940) (← links)
- Further results on (total) restrained Italian domination (Q6551202) (← links)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms (Q6558691) (← links)
- Approximation algorithm for the minimum partial connected Roman dominating set problem (Q6571270) (← links)
- An upper bound on the total Roman \(\{2\}\)-domination number of graphs with minimum degree two (Q6580152) (← links)
- On the total restrained double Italian domination (Q6585921) (← links)
- On the total version of the covering Italian domination problem (Q6611080) (← links)
- Perfect Italian domination number of graphs (Q6613044) (← links)
