Linear programming formulation for some generalized domination parameters
From MaRDI portal
Recommendations
Cites work
- R -Domination in Graphs
- \((k,k^\prime,k^{\prime\prime})\)-domination in graphs
- \([1,2]\)-domination in graphs
- \([1,2]\)-sets in graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Efficient (j,k)-domination
- Factor domination and minimum degree
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 4204392 (Why is no real title available?)
- Independent domination in chordal graphs
- Integer linear programming formulations for double Roman domination problem
- Integer linear programming models for the weighted total domination problem
- Linear programming approach for various domination parameters
- Lower bound on the distance k-domination number of a tree
- Secondary domination in graphs
- Unsolved problems in number theory
Cited in
(6)- Total vertex-edge domination in graphs: Complexity and algorithms
- Linear programming approach for various domination parameters
- Positive linear relation and application to domination problem.
- Strong restrained domination number on trees and product of graphs: An algorithmic approach
- Binary programming formulations for the upper domination problem
- Complexity issues concerning the quadruple Roman domination problem in graphs
This page was built for publication: Linear programming formulation for some generalized domination parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013502)