Výsledky vyhledávání - "Wagler, Annegret"

Report

Autor: Chakraborty, Dipayan, Wagler, Annegret K.

Several different types of identification problems have been already studied in the literature, where the objective is to distinguish any two vertices of a graph by their unique neighborhoods in a suitably chosen dominating or total-dominating set of

Externí odkaz: http://arxiv.org/abs/2407.10595

Zobrazit plný text záznamu

Report

Open-separating dominating codes in graphs

Autor: Chakraborty, Dipayan, Wagler, Annegret K.

Using dominating sets to separate vertices of graphs is a well-studied problem in the larger domain of identification problems. In such problems, the objective is to choose a suitable dominating set $C$ of a graph $G$ such that the neighbourhoods of

Externí odkaz: http://arxiv.org/abs/2402.03015

Zobrazit plný text záznamu

Report

Location-Domination Type Problems Under the Mycielski Construction

Autor: Bianchi, Silvia M., Chakraborty, Dipayan, Lucarini, Yanina, Wagler, Annegret K.

We consider the following variants of the classical minimum dominating set problem in graphs: locating-dominating set, locating total-dominating set and open locating-dominating set. All these problems are known to be hard for general graphs. A typic

Externí odkaz: http://arxiv.org/abs/2311.13979

Zobrazit plný text záznamu

Report

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

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

Publikováno v: Discrete Mathematics 347 (2024), 114176

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 dist

Externí odkaz: http://arxiv.org/abs/2211.14178

Zobrazit plný text záznamu