The binary locating-dominating number of some convex polytopes
From MaRDI portal
Recommendations
- Binary locating-dominating sets in rotationally-symmetric convex polytopes
- The open-locating-dominating number of some convex polytopes
- A polyhedral approach to locating-dominating sets in graphs
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
- On locating-domination in graphs
Cites work
- An optimal locating-dominating set in the infinite triangular grid
- Domination and location in acyclic graphs
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Fault-tolerant locating-dominating sets
- Generalized domination and efficient domination in graphs
- scientific article; zbMATH DE number 5717189 (Why is no real title available?)
- scientific article; zbMATH DE number 4081585 (Why is no real title available?)
- scientific article; zbMATH DE number 125446 (Why is no real title available?)
- scientific article; zbMATH DE number 861343 (Why is no real title available?)
- scientific article; zbMATH DE number 6119641 (Why is no real title available?)
- scientific article; zbMATH DE number 6396742 (Why is no real title available?)
- Identifying and locating-dominating codes in (random) geometric networks
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- Identifying codes and locating-dominating sets on paths and cycles
- Identifying codes in hereditary classes of graphs and VC-dimension
- LD-graphs and global location-domination in bipartite graphs
- Locating and total dominating sets in trees
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- New variable neighborhood search based 0-1 MIP heuristics
- On families of convex polytopes with constant metric dimension
- On locating--dominating sets in infinite grids
- On the ensemble of optimal dominating and locating-dominating codes in a graph
- Open neighborhood locating-dominating in trees
- Vertex-magic total labeling of generalized Petersen graphs and convex polytopes
Cited in
(8)- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
- Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
- Polyhedra associated with open locating-dominating and locating total-dominating sets in graphs
- Binary locating-dominating sets in rotationally-symmetric convex polytopes
- A polyhedral approach to locating-dominating sets in graphs
- The open-locating-dominating number of some convex polytopes
- Total Roman domination on the digraphs
- On the binary locating-domination number of regular and strongly-regular graphs
This page was built for publication: The binary locating-dominating number of some convex polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604525)
