The following pages link to Weak Roman domination in graphs (Q3171420):
Displaying 22 items.
- Roman \(\{2 \}\)-domination (Q266795) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- Weak Roman bondage number of a graph (Q779190) (← links)
- Improved integer linear programming formulation for weak Roman domination problem (Q1626222) (← links)
- Double Roman domination number (Q1752604) (← links)
- Roman \(\{2\}\)-bondage number of a graph (Q2282478) (← links)
- Effect of vertex deletion on the weak Roman domination number of a graph (Q2293840) (← links)
- Weakly connected Roman domination in graphs (Q2322879) (← links)
- Exact algorithms for weak Roman domination (Q2413969) (← links)
- On the weak Roman domination number of lexicographic product graphs (Q2420431) (← links)
- Roman domination in unicyclic graphs (Q2833278) (← links)
- Exact Algorithms for Weak Roman Domination (Q2870018) (← links)
- Trees \(T\) with weak Roman domination number being equal to domination number (Q2924253) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- (Q4901046) (← links)
- Weak Roman subdivision number of graphs (Q5063279) (← links)
- (Q5070078) (← links)
- (Q5134323) (← links)
- Secure vertex cover of a graph (Q5347260) (← links)
- An algorithm to recognize weak roman domination stable trees under vertex deletion (Q5858156) (← links)
- Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
- (Q6149321) (← links)
