Kaustav Paul

collaborators

2 papers

cs.DM2023

Complexity of total dominator coloring in graphs

Michael A. Henning, Kusum, Arti Pandey +1

Let $G = (V, E)$ be a graph with no isolated vertices. A vertex $v$ totally dominate a vertex $w$ ( $w \neq = v$ ), if $v$ is adjacent to $w$ . A set $D \subseteq V$ called a total dominati…

cs.DM2021

Complexity of Paired Domination in AT-free and Planar Graphs

Vikash Tripathi, Ton Kloks, Arti Pandey +2

For a graph $G = (V, E)$ , a subset $D$ of vertex set $V$ , is a dominating set of $G$ if every vertex not in $D$ is adjacent to atleast one vertex of $D$ . A dominating set $D$ of a gra…