Soumyashree Rana

collaborators

3 papers

cs.CC2026

$m$ -Eternal Dominating Set Problem on Subclasses of Chordal Graphs

Ashutosh Rai, Soumyashree Rana

A dominating set of a graph G(V, E) is a set of vertices D\subseteq V such that every vertex in V\D has a neighbor in D. An eternal dominating set extends this concept by placing m…

cs.CC2023

Disjoint Dominating and 2-Dominating Sets in Graphs: Hardness and Approximation results

Soumyashree Rana, Sounaka Mishra, Bhawani Sankar Panda

A set $D \subseteq V$ of a graph $G = (V, E)$ is a dominating set of $G$ if each vertex $v \in V ∖ D$ is adjacent to at least one vertex in $D,$ whereas a set $D_{2} \subseteq V$ …

cs.DS2023

On the Complexity of Co-secure Dominating Set Problem

B S Panda, Soumyashree Rana, Sounaka Mishra

A set $D \subseteq V$ of a graph $G = (V, E)$ is a dominating set of $G$ if every vertex $v \in V ∖ D$ is adjacent to at least one vertex in $D .$ A set $S \subseteq V$ is a co-…

m-Eternal Dominating Set Problem on Subclasses of Chordal Graphs

Disjoint Dominating and 2-Dominating Sets in Graphs: Hardness and Approximation results

On the Complexity of Co-secure Dominating Set Problem

$m$ -Eternal Dominating Set Problem on Subclasses of Chordal Graphs