Publication | Open Access
The binary locating-dominating number of some convex polytopes
14
Citations
20
References
2017
Year
Mathematical ProgrammingEngineeringLocating-dominating NumberGeometric AlgorithmBinary Locating-dominating NumberComputational ComplexityExtremal CombinatoricsConvex HullGomory-chvátal TheoryDiscrete MathematicsCombinatorial OptimizationComputational GeometryConvex Polytopes
In this paper the binary locating-dominating number of convex polytopes is considered. The exact value is determined and proved for convex polytopes Dn and Rʺn, while for the convex polytopes Rn, Qn and Un a tight upper bound of the locating-dominating number is presented.
| Year | Citations | |
|---|---|---|
Page 1
Page 1