The following pages link to (Q5243996):
Displayed 18 items.
- Constructive characterizations concerning weak Roman domination in trees (Q777409) (← links)
- Secure Italian domination in graphs (Q2025095) (← links)
- Italian domination of Cartesian products of directed cycles (Q2028072) (← links)
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs (Q2045048) (← links)
- Efficient \((j, k)\)-dominating functions (Q2107745) (← links)
- Total Roman \(\{2\}\)-dominating functions in graphs (Q2151223) (← links)
- Bounds on the double Italian domination number of a graph (Q2158195) (← links)
- Graphs with large Italian domination number (Q2210211) (← links)
- Italian domination in rooted product graphs (Q2227964) (← links)
- From the strong differential to Italian domination in graphs (Q2238746) (← links)
- Perfect Italian domination in cographs (Q2661056) (← links)
- Graphs with small Italian domatic number (Q2700605) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- (Q4957549) (← 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)
- 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)