Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
type: Item
instance of: scholarly article
title: Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
zbMATH Open document ID: 1498.05199
author: Annegret K. Wagler
author: Gabriela R. Argiroffo
author: Silvia M. Bianchi
author: Yanina P. Lucarini
published in: Discrete Applied Mathematics
publication date: 2022-10-13T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 52B99
zbMATH DE Number: 7600656
zbMATH Keywords: locating-dominating set problem
zbMATH Keywords: open locating-dominating set problem
zbMATH Keywords: locating total-dominating set problem
zbMATH Keywords: polyhedral approach
MaRDI profile type: Publication
full work available at URL: j.dam.2022.06.025
OpenAlex ID: W4283773152
cites work: On the set covering polyhedron of circulant matrices
cites work: Polyhedra associated with identifying codes in graphs
cites work: Polyhedra associated with open locating-dominating and locating total-dominating sets in graphs
cites work: Study of Identifying Code Polyhedra for Some Families of Split Graphs
cites work: A polyhedral approach to locating-dominating sets in graphs
cites work: Progress on the description of identifying code polyhedra for some families of split graphs
cites work: On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
cites work: Identifying and locating-dominating codes on chains and cycles
cites work: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
cites work: Q3789614
cites work: Q4193514
cites work: The Complexity of the Identifying Code Problem in Restricted Graph Classes
cites work: Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs
cites work: On graphs having a \(V\setminus \{x\}\) set as an identifying code
cites work: Locating and total dominating sets in trees
cites work: Locating-total domination in graphs
cites work: On a new class of codes for identifying vertices in graphs
cites work: Identifying and Locating–Dominating Codes in (Random) Geometric Networks
cites work: Facets and lifting procedures for the set covering polytope
cites work: Q3565861
cites work: Q3803159
DOI: 10.1016/J.DAM.2022.06.025
description: scientific article; zbMATH DE number 7600656