15 citations · 17 across the 24 of their papers we have counts for
5 papers · 1 filter
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.…