The following pages link to Italian domination in trees (Q516889):
Displaying 48 items.
- Constructive characterizations concerning weak Roman domination in trees (Q777409) (← links)
- A characterization of double Roman trees (Q1735679) (← links)
- Perfect Italian domination in trees (Q1741510) (← links)
- Italian domination in the Cartesian product of paths (Q2025085) (← links)
- Secure Italian domination in graphs (Q2025095) (← links)
- Italian domination of Cartesian products of directed cycles (Q2028072) (← links)
- Total Roman \(\{2\}\)-reinforcement of graphs (Q2035667) (← links)
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs (Q2045048) (← links)
- Further results on the signed Italian domination (Q2053257) (← links)
- Efficient \((j, k)\)-dominating functions (Q2107745) (← links)
- Roman \(\{2\}\)-domination problem in graphs (Q2118251) (← links)
- On the Italian reinforcement number of a digraph (Q2133372) (← links)
- Total protection of lexicographic product graphs (Q2151225) (← links)
- Bounds on the double Italian domination number of a graph (Q2158195) (← links)
- Perfect Italian domination in graphs: complexity and algorithms (Q2161253) (← links)
- Roman \(\{ 3 \}\)-domination (double Italian domination) (Q2192109) (← links)
- On the independent double Roman domination in graphs (Q2196412) (← links)
- Perfect Italian domination on planar and regular graphs (Q2197486) (← links)
- Graphs with large Italian domination number (Q2210211) (← links)
- A constructive characterization of vertex cover Roman trees (Q2214322) (← links)
- Italian domination in rooted product graphs (Q2227964) (← links)
- From the strong differential to Italian domination in graphs (Q2238746) (← links)
- Graphs with equal domination and covering numbers (Q2292127) (← links)
- On the double Roman domination in graphs (Q2410217) (← links)
- Triple Roman domination in graphs (Q2661014) (← links)
- Perfect Italian domination in cographs (Q2661056) (← links)
- Graphs with small Italian domatic number (Q2700605) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- Rainbow Domination in Graphs (Q3384615) (← links)
- (Q3391333) (← links)
- Independent double Roman domination in graphs (Q4956191) (← links)
- (Q4957549) (← links)
- Bounds on the co-Roman domination number in graphs (Q4985578) (← links)
- Total Roman {2}-domination in graphs (Q4986532) (← links)
- On the Roman {2}-domatic number of graphs (Q5025122) (← links)
- Italian domination and perfect Italian domination on Sierpiński graphs (Q5035034) (← 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)
- ON THE CHARACTERIZATION OF ROMAN DOMINATING SETS IN TREES (Q5076235) (← links)
- (Q5076568) (← links)
- Global italian domination in graphs (Q5238044) (← links)
- Trees with equal Roman {2}-domination number and independent Roman {2}-domination number (Q5242342) (← links)
- A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers (Q5242940) (← links)
- On the computational complexity of Roman\(\{2\}\)-domination in grid graphs (Q6043333) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
- Approximation algorithm for (connected) Italian dominating function (Q6090069) (← links)
- Outer independent double Italian domination: Complexity, characterization (Q6132230) (← links)
- EDGE ITALIAN DOMINATION OF SOME GRAPH PRODUCTS (Q6203972) (← links)
