The following pages link to (Q4957549):
Displaying 19 items.
- Total Roman \(\{2\}\)-reinforcement of graphs (Q2035667) (← links)
- On the Italian reinforcement number of a digraph (Q2133372) (← links)
- Hardness and approximation results of Roman \{3\}-domination in graphs (Q2695277) (← links)
- Outer independent Roman domination number of trees (Q4957568) (← links)
- Remarks on the outer-independent double Italian domination number (Q5004072) (← links)
- On the outer-independent double Italian domination number (Q5054034) (← links)
- Lower and upper bounds on independent double Roman domination in trees (Q5054041) (← links)
- Total double Roman domination numbers in digraphs (Q5101908) (← links)
- Double Roman reinforcement number in graphs (Q5861712) (← links)
- Quadruple Roman domination in graphs (Q5866033) (← links)
- Double Roman domination subdivision number in graphs (Q5876741) (← links)
- Efficient algorithms for independent Roman domination on some classes of graphs (Q6097713) (← links)
- (Q6097717) (← links)
- Outer independent double Italian domination: Complexity, characterization (Q6132230) (← links)
- (Q6155856) (← links)
- Restrained Italian bondage number in graphs (Q6174745) (← links)
- Outer independent total double Italian domination number (Q6546350) (← 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)
