Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
From MaRDI portal
Publication:2081516
DOI10.1016/j.dam.2022.06.025zbMath1498.05199OpenAlexW4283773152MaRDI QIDQ2081516
Annegret K. Wagler, Gabriela R. Argiroffo, Yanina P. Lucarini, Silvia M. Bianchi
Publication date: 13 October 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.06.025
polyhedral approachlocating total-dominating set problemlocating-dominating set problemopen locating-dominating set problem
Polytopes and polyhedra (52B99) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polyhedral approach to locating-dominating sets in graphs
- Locating-total domination in graphs
- On graphs having a \(V\setminus \{x\}\) set as an identifying code
- On the set covering polyhedron of circulant matrices
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- Facets and lifting procedures for the set covering polytope
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- Progress on the description of identifying code polyhedra for some families of split graphs
- Polyhedra associated with identifying codes in graphs
- Identifying and locating-dominating codes on chains and cycles
- Polyhedra associated with open locating-dominating and locating total-dominating sets in graphs
- Locating and total dominating sets in trees
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs
- The Complexity of the Identifying Code Problem in Restricted Graph Classes
- Study of Identifying Code Polyhedra for Some Families of Split Graphs
- Identifying and Locating–Dominating Codes in (Random) Geometric Networks
- On a new class of codes for identifying vertices in graphs
