Sandip Das

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

Exact-Distance Domination in Grid Graphs

Sandip Das, Sweta Das, Arpan Sadhukhan

Let $G_{n}$ be the $n \times n$ square grid, and let $k \geq 2$ . A set $D \subseteq V (G_{n})$ is an \emph{exact-distance $k$ -dominating set} if every vertex $v \in V (G_{n}) ∖ D$ has a…

math.CO2026

Parameterized complexity of $r$ -Hop, $r$ -Step, and $r$ -Hop Roman Domination

Sandip Das, Sweta Das, Sk Samim Islam

The \textsc{Dominating Set} problem is a classical and extensively studied topic in graph theory and theoretical computer science. In this paper, we examine the algorithmic complex…

math.CO2026

On the Number of Almost Empty Monochromatic Triangles

Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam +3

In this paper, we consider the problem of counting almost empty monochromatic triangles in colored planar point sets, that is, triangles whose vertices are all assigned the same co…

Exact-Distance Domination in Grid Graphs

Parameterized complexity of r-Hop, r-Step, and r-Hop Roman Domination

On the Number of Almost Empty Monochromatic Triangles

Parameterized complexity of $r$ -Hop, $r$ -Step, and $r$ -Hop Roman Domination