12 papers · 1 filter
The Interplay Between Domination and Separation in Graphs
Dipayan Chakraborty, Annegret K. Wagler
In the literature, several identification problems in graphs have been studied, of which, the most widely studied are the ones based on dominating sets as a tool of identification.…
On full-separating sets and related codes in graphs
Dipayan Chakraborty, Annegret K. Wagler
A domination-based identification problem on a graph is one where the objective is to choose a subset of the vertex set of such that has both, a domination property…
Identifying codes in graphs of given maximum degree: Characterizing trees
Dipayan Chakraborty, Florent Foucaud, Michael A. Henning +1
An identifying code of a closed-twin-free graph is a dominating set of vertices of such that any two vertices in have a distinct intersection between their closed n…
On open-separating dominating codes in graphs
Dipayan Chakraborty, Annegret K. Wagler
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 suita…
On lower bounds for cardinalities of several separating-dominating codes in graphs
Dipayan Chakraborty, Annegret K. Wagler
In the literature, several different identification problems in graphs have been studied, the most widely studied such problems are the ones based on dominating sets as a tool of i…
Progress towards the two-thirds conjecture on locating-total dominating sets
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen +2
We study upper bounds on the size of optimum locating-total dominating sets in graphs. A set of vertices of a graph is a locating-total dominating set if every vertex of $G…