Pages that link to "Item:Q5038168"
From MaRDI portal
The following pages link to Integer linear programming formulations for double roman domination problem (Q5038168):
Displaying 9 items.
- Improved integer linear programming formulation for weak Roman domination problem (Q1626222) (← links)
- The domination number of wrapped butterfly digraphs (Q2244175) (← links)
- Triple Roman domination in graphs (Q2661014) (← links)
- Linear programming formulation for some generalized domination parameters (Q5013502) (← links)
- Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
- 3-component domination numbers in graphs (Q6117350) (← links)
- The extended dominating sets in graphs (Q6542990) (← links)
- Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles (Q6550939) (← links)
- Complexity issues concerning the quadruple Roman domination problem in graphs (Q6658307) (← links)