Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2022

Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs

Résumé

The problems of determining locating-dominating, open locating-dominating or locating total-dominating sets of minimum cardinality in a graph G are variations of the classical minimum dominating set problem in G and are all known to be hard for general graphs. A typical line of attack is therefore to determine the cardinality of minimum such sets in special graphs. In this work we study the three problems from a polyhedral point of view. We provide the according linear relaxations, discuss their combinatorial structure, and demonstrate how the associated polyhedra can be entirely described or polyhedral arguments can be applied to find minimum such sets for special graphs.
Fichier principal
Vignette du fichier
ABLW_DO_polyhedra_subm.pdf (245.17 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04403994 , version 1 (18-01-2024)

Identifiants

Citer

Gabriela Argiroffo, Silvia Bianchi, Yanina Lucarini, Annegret Wagler. Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs. Discrete Applied Mathematics, 2022, 322, pp.465-480. ⟨10.1016/j.dam.2022.06.025⟩. ⟨hal-04403994⟩
11 Consultations
6 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More