Arti Pandey

activity

20152025

collaborators

Showing cs.DMShow all

9 papers · 1 filter

cs.DM2024

Algorithmic Results for Weak Roman Domination Problem in Graphs

Kaustav Paul, Ankit Sharma, Arti Pandey

Consider a graph $G = (V, E)$ and a function $f : V \to {0, 1, 2}$ . A vertex $u$ with $f (u) = 0$ is defined as \emph{undefended} by $f$ if it lacks adjacency to any vertex w…

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…

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…

cs.DM2020

Semipaired Domination in Some Subclasses of Chordal Graphs

Michael A. Henning, Arti Pandey, Vikash Tripathi

A dominating set $D$ of a graph $G$ without isolated vertices is called semipaired dominating set if $D$ can be partitioned into $2$ -element subsets such that the vertices in each…

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