Subhabrata Paul

collaborators

4 papers

math.CO2025

Liar's vertex-edge domination in unit disk graph

Debojyoti Bhattacharya, Subhabrata Paul

Let $G = (V, E)$ be a simple undirected graph. A closed neighbourhood of an edge $e = uv$ between two vertices $u$ and $v$ of $G$ , denoted by $N_{G} [e]$ , is the set of vertices in the ne…

math.CO2025

Liar's vertex-edge domination in subclasses of chordal graphs

Debojyoti Bhattacharya, Subhabrata Paul

Let $G = (V, E)$ be an undirected graph. The set $N_{G} [x] = {y \in V ∣ x y \in E} \cup {x}$ is called the closed neighbourhood of a vertex $x \in V$ and for an edge $e = x y \in E$ , the closed…

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

On the Complexity and Algorithms for the Upper Domatic Number of Graphs

Subhabrata Paul, Kamal Santra

Let $G$ be a graph. For two disjoint vertex sets $A,B\subseteq V(G)$, we say that $A$ dominates $B$ if every vertex of $B$ has a neighbour in $A$. An upper domatic part…