G. K. Das

works on

chordal bipartite graphs 1 computational complexity 1 convex bipartite graphs 1 dynamic programming 1 roman domination 1

From the 1 of 4 linked papers with an AI index.

collaborators

Showing cs.CCShow all

1 paper · 1 filter

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)$ …