Progress towards the two-thirds conjecture on locating-total dominating sets - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

Progress towards the two-thirds conjecture on locating-total dominating sets

Résumé

We study upper bounds on the size of optimum locating-total dominating sets in graphs. A set $S$ of vertices of a graph $G$ is a locating-total dominating set if every vertex of $G$ has a neighbor in $S$, and if any two vertices outside $S$ have distinct neighborhoods within $S$. The smallest size of such a set is denoted by $\gamma^L_t(G)$. It has been conjectured that $\gamma^L_t(G)\leq\frac{2n}{3}$ holds for every twin-free graph $G$ of order $n$ without isolated vertices. We prove that the conjecture holds for cobipartite graphs, split graphs, block graphs, subcubic graphs and outerplanar graphs.
Fichier principal
Vignette du fichier
CFHHW_LTD_two-thirds_Conjecture.pdf (512.93 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03876474 , version 1 (28-11-2022)

Identifiants

Citer

Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret K. Wagler. Progress towards the two-thirds conjecture on locating-total dominating sets. 2022. ⟨hal-03876474⟩
42 Consultations
11 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More