Kusum

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.DM2023

Cosecure Domination: Hardness Results and Algorithm

Kusum, Arti Pandey

For a simple graph $G = (V, E)$ without any isolated vertex, a cosecure dominating set $D$ of $G$ satisfies the following two properties (i) $S$ is a dominating set of $G$ , (ii) for e…