11 citations · 20 across the 29 of their papers we have counts for
35 papers
On the Cop Number of String Graphs
Sandip Das, Harmender Gahlawat
Cops and Robber is a well-studied two-player pursuit-evasion game played on a graph, where a group of cops tries to capture the robber. The \emph{cop number} of a graph is the mini…
Multipacking and broadcast domination on cactus graph and its impact on hyperbolic graph
Sandip Das, Sk Samim Islam
For a graph , is the multipacking number, and is the broadcast domination number. It is known that and for any graph…
Burning a binary tree and its generalization
Sandip Das, Sk Samim Islam, Ritam M Mitra +1
Graph burning is a graph process that models the spread of social contagion. Initially, all the vertices of a graph are unburnt. At each step, an unburnt vertex is put on fire…
On -chromatic numbers of graphs having bounded sparsity parameters
Sandip Das, Abhiruk Lahiri, Soumen Nandi +2
An -graph is characterised by having types of arcs and types of edges. A homomorphism of an -graph to an -graph , is a vertex mapping that prese…
Counting the minimum number of arcs in an oriented graph having weak diameter 2
Sandip Das, Koushik Kumar Dey, Pavan P D +1
An oriented graph has weak diameter at most if every non-adjacent pair of vertices are connected by a directed -path. The function denotes the minimum number of arc…
A Subquadratic Time Algorithm for the Weighted -Center Problem on Cactus Graphs
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
The weighted -center problem in graphs is a classical facility location problem where we place centers on the graph, which minimize the maximum weighted distance of a vertex…