S. Paul

activity

20152022

most citedTransitivity on subclasses of bipartite graphs

2 citations · 2 across the 2 of their papers we have counts for

collaborators

3 papers

cs.DM2022★ 2 cited

Transitivity on subclasses of bipartite graphs

Subhabrata Paul, Kamal Santra

Let $G = (V, E)$ be a graph where $V$ and $E$ are the vertex and edge set, respectively. For two disjoint subsets $A$ and $B$ , we say $A$ dominates $B$ if every vertex of $B$ is adja…

cs.DM2019

On vertex-edge and independent vertex-edge domination

Subhabrata Paul, Keshav Ranjan

Given a graph $G = (V, E)$ , a vertex $u \in V$ ve-dominates all edges incident to any vertex of $N_{G} [u]$ . A set $S \subseteq V$ is a ve-dominating set if for all edges $e \in E$ , the…

cs.DM2015

Algorithmic aspects of disjunctive domination in graphs

B. S. Panda, Arti Pandey, S. Paul

For a graph $G = (V, E)$ , a set $D \subseteq V$ is called a \emph{disjunctive dominating set} of $G$ if for every vertex $v \in V ∖ D$ , $v$ is either adjacent to a vertex of $D$ …