Debojyoti Bhattacharya

activity

20232026

collaborators

Showing 2023Show all

2 papers · 1 filter

math.CO2023

On $k$ -vertex-edge domination of graph

Debojyoti Bhattacharya, Subhabrata Paul

Let $G = (V, E)$ be a simple undirected graph. The open neighbourhood of a vertex $v$ in $G$ is defined as $N_{G} (v) = {u \in V ∣ uv \in E}$ ; whereas the closed neighbourhood is defined…

cs.DS2023

Algorithmic study on liar's vertex-edge domination problem

Debojyoti Bhattacharya, Subhabrata Paul

Let $G = (V, E)$ be a graph. For an edge $e = x y \in E$ , the closed neighbourhood of $e$ , denoted by $N_{G} [e]$ or $N_{G} [x y]$ , is the set $N_{G} [x] \cup N_{G} [y]$ . A vertex set $L \subseteq V$ is…

On k-vertex-edge domination of graph

Algorithmic study on liar's vertex-edge domination problem

On $k$ -vertex-edge domination of graph