Arti Pandey

activity

20152021

collaborators

5 papers

math.CO2021

A linear-time algorithm for semitotal domination in strongly chordal graphs

Vikash Tripathi, Arti Pandey, Anil Maheshwari

In a graph $G = (V, E)$ with no isolated vertex, a dominating set $D \subseteq V$ , is called a semitotal dominating set if for every vertex $u \in D$ there is another vertex $v \in D$ …

cs.DM2019

Complexity and Algorithms for Semipaired Domination in Graphs

Michael A. Henning, Arti Pandey, Vikash Tripathi

For a graph $G = (V, E)$ with no isolated vertices, a set $D \subseteq V$ is called a semipaired dominating set of G if $(i)$ $D$ is a dominating set of $G$ , and $(ii)$ $D$ can be part…

cs.DM2017

Algorithmic Aspects of Semitotal Domination in Graphs

Michael A. Henning, Arti Pandey

For a graph $G = (V, E)$ , a set $D \subseteq V$ is called a semitotal dominating set of $G$ if $D$ is a dominating set of $G$ , and every vertex in $D$ is within distance~ $2$ of anothe…

cs.DM2016

Some Algorithmic Results on Restrained Domination in Graphs

Arti Pandey, B. S. Panda

A set $D \subseteq V$ of a graph $G = (V, E)$ is called a restrained dominating set of $G$ if every vertex not in $D$ is adjacent to a vertex in $D$ and to a vertex in $V ∖ D$ .…

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$ …