15 citations · 17 across the 24 of their papers we have counts for
25 papers
A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set
Dipayan Chakraborty, Florent Foucaud, Michael A. Henning +1
A set of vertices in a graph is a dominating set of if every vertex not in has a neighbor in , where two vertices are neighbors if they are adjacent. The dominat…
Pure State Transformations under Block Coherence
Dipayan Chakraborty, Priyabrata Char, Indrani Chattopadhyay +1
Block coherence provides a natural generalization of standard quantum coherence by treating superpositions across different subspaces as a resource. This work studies deterministic…
Catalytic Enhancement of Coherence in Noisy Quantum Channels and Characterization of Strictly Incoherent Operations
Priyabrata Char, Dipayan Chakraborty, Indrani Chattopadhyay +1
In realistic quantum information processing tasks, quantum states are inevitably affected by environmental noise, leading to decoherence and degradation of useful quantum resources…
On the Complexity of Vertex-Splitting Into an Interval Graph
Faisal N. Abu-Khzam, Dipayan Chakraborty, Lucas Isenmann +1
Vertex splitting is a graph modification operation in which a vertex is replaced by multiple vertices such that the union of their neighborhoods equals the neighborhood of the orig…
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 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…
Location-Domination Type Problems Under the Mycielski Construction
Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini +1
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 se…
Contracting edges to destroy a pattern: A complexity study
Dipayan Chakraborty, R. B. Sandeep
Given a graph G and an integer k, the objective of the -Contraction problem is to check whether there exists at most k edges in G such that contracting them in G results in a gr…
On locating and neighbor-locating colorings of sparse graphs
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi +2
A proper -coloring of a graph is a \emph{neighbor-locating -coloring} if for each pair of vertices in the same color class, the two sets of colors found in their respecti…
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…
Catalytic Transformations in Coherence Theory
Priyabrata Char, Dipayan Chakraborty, Amit Bhar +2
In 2016, A. Winter et al.(Physical Review Letters 116 (12) (2016) 120404) provided an operational meaning to relative entropy of coherence and coherence of formation by introducing…
A linear algorithm for radio -coloring of powers of paths having small diameters
Dipayan Chakraborty, Soumen Nandi, Sagnik Sen +1
The radio -chromatic number of a graph is the minimum integer such that there exists a function satisfying $|ϕ(u)-ϕ(v)| \geq k+…
On clique numbers of colored mixed graphs
Dipayan Chakraborty, Sandip Das, Soumen Nandi +2
An (m,n)-colored mixed graph, or simply, an (m,n)-graph is a graph having m different types of arcs and n different types of edges. A homomorphism of an (m,n)-graph G to another (m…
Necessary and Sufficient Condition for the Equivalence of Two Pure Multipartite States under Stochastic Local Incoherent Operations and Classical Communications
Dipayan Chakraborty, Prabir Kumar Dey, Nabendu Das +3
Resource theory of quantum coherence originated like entanglement in quantum information theory. However, still now proper classification of quantum states is missing under coheren…
Structure of Resource Theory of Block Coherence
Prabir Kumar Dey, Dipayan Chakraborty, Priyabrata Char +3
Emerging from the superposition principle, the resource theory of coherence plays a crucial role in many information-processing tasks. Recently, a generalization to this resource t…