15 citations · 17 across the 24 of their papers we have counts for
10 papers · 1 filter
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…
Structural Parameterization of Locating-Dominating Set and Test Cover
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar +1
We investigate structural parameterizations of two identification problems: LOCATING-DOMINATING SET and TEST COVER. In the first problem, an input is a graph on vertices an…
Multipartite Monogamy of Entanglement for Three Qubit States
Priyabrata Char, Dipayan Chakraborty, Prabir Kumar Dey +4
The distribution of entanglement in a multiparty system can be described through the principles of monogamy or polygamy. Monogamy is a fundamental characteristic of entanglement th…
Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
Dipayan Chakraborty, Florent Foucaud, Michael A. Henning
An identifying open code of a graph is a set of vertices that is both a separating open code (that is, for all distinct vertices and $…
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…
The -bound for locating-dominating sets in subcubic graphs
Dipayan Chakraborty, Anni Hakanen, Tuomo Lehtilä
The location-domination number is conjectured to be at most half of the order for twin-free graphs with no isolated vertices. We prove that this conjecture holds and is tight for s…
Identifying codes in triangle-free graphs of bounded maximum degree
Dipayan Chakraborty, Florent Foucaud, Michael A. Henning +1
An identifying code of a closed-twin-free graph is a set of vertices of such that any two vertices in have a distinct, nonempty intersection between their closed ne…
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…
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar +1
We investigate fine-grained algorithmic aspects of identification problems in graphs and set systems, with a focus on Locating-Dominating Set and Test Cover. We prove the (tight) c…
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…