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

arXiv2211.14178MaRDI QIDQ6418463FDOQ6418463

Authors: Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret K. Wagler 

Publication date: 25 November 2022

Abstract: 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 $gamm{a}_t^L(G)$. It has been conjectured that $gamm{a}_t^L(G)leqfrac2n3$ 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.

This page was built for publication: Progress towards the two-thirds conjecture on locating-total dominating sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6418463)