Kaustav Paul

collaborators

3 papers

cs.CC2024

(Independent) Roman Domination Parameterized by Distance to Cluster

Pradeesha Ashok, Gautam K. Das, Arti Pandey +2

Given a graph $G = (V, E)$ , a function $f : V \to {0, 1, 2}$ is said to be a \emph{Roman Dominating function} (RDF) if for every $v \in V$ with $f (v) = 0$ , there exists a vertex $u \in N (v)$ …

math.CO2024

Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs

Kaustav Paul, Ankit Sharma, Arti Pandey

Given a graph $G = (V, E)$ , a function $f : V \to {0, 1, 2}$ is said to be a \emph{Roman Dominating function} if for every $v \in V$ with $f (v) = 0$ , there exists a vertex $u \in N (v)$ such…

cs.DM2024

Algorithmic Results for Weak Roman Domination Problem in Graphs

Kaustav Paul, Ankit Sharma, Arti Pandey

Consider a graph $G = (V, E)$ and a function $f : V \to {0, 1, 2}$ . A vertex $u$ with $f (u) = 0$ is defined as \emph{undefended} by $f$ if it lacks adjacency to any vertex w…