Pages that link to "Item:Q1693166"
From MaRDI portal
The following pages link to Independent Roman \(\{2 \}\)-domination in graphs (Q1693166):
Displaying 20 items.
- Roman \(\{2 \}\)-domination (Q266795) (← links)
- Italian domination in the Cartesian product of paths (Q2025085) (← links)
- Total Roman \(\{2\}\)-reinforcement of graphs (Q2035667) (← links)
- Roman \(\{2\}\)-domination problem in graphs (Q2118251) (← links)
- On the Italian reinforcement number of a digraph (Q2133372) (← links)
- Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number (Q2151206) (← links)
- On the independent double Roman domination in graphs (Q2196412) (← links)
- Graphs with large Italian domination number (Q2210211) (← links)
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs (Q2307496) (← links)
- Outer-independent total Roman domination in graphs (Q2328098) (← links)
- Complexity aspects of variants of independent Roman domination in graphs (Q2666348) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- Rainbow Domination in Graphs (Q3384615) (← links)
- (Q3391333) (← links)
- A note on the independent Roman domination in unicyclic graphs (Q4908863) (← links)
- Independent double Roman domination in graphs (Q4956191) (← links)
- Independent roman $\{3\}$-domination (Q5103952) (← links)
- Trees with equal Roman {2}-domination number and independent Roman {2}-domination number (Q5242342) (← links)
- Further results on the independent Roman domination number of graphs (Q6039055) (← links)
- (Q6150924) (← links)