Arti Pandey

activity

20152025

collaborators

17 papers

math.CO2025

Vertex-edge domination on subclasses of bipartite graphs

Arti Pandey, Kaustav Paul, Kamal Santra

Given a simple undirected graph $G = (V, E)$ , the open neighbourhood of a vertex $v \in V$ is defined as $N_{G} (v) = {u \in V ∣ uv \in E}$ , and the closed neighbourhood as $N_G[…

math.CO2025

Edge open packing: further characterizations

Arti Pandey, Kamal Santra

Let $G = (V, E)$ be a graph where $V (G)$ and $E (G)$ are the vertex and edge sets, respectively. In a graph $G$ , two edges $e_{1}, e_{2} \in E (G)$ are said to have \emph{common edge} $e\ne…

math.CO2025

Characterizing optimal monitoring edge-geodetic sets for some structured graph classes

Florent Foucaud, Arti Pandey, Kaustav Paul

Given a graph $G = (V, E)$ , a set $S \subseteq V$ is said to be a monitoring edge-geodetic set if the deletion of any edge in the graph results in a change in the distance between at l…

cs.CC2024

(Independent) Roman Domination Parameterized by Distance to Cluster

Pradeesha Ashok, Gautam K. Das, Arti Pandey +2

Given a graph $G = (V, E)$ , a function $f : V \to {0, 1, 2}$ is said to be a \emph{Roman Dominating function} (RDF) if for every $v \in V$ with $f (v) = 0$ , there exists a vertex $u \in N (v)$ …

math.CO2024

Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs

Kaustav Paul, Ankit Sharma, Arti Pandey

Given a graph $G = (V, E)$ , a function $f : V \to {0, 1, 2}$ is said to be a \emph{Roman Dominating function} if for every $v \in V$ with $f (v) = 0$ , there exists a vertex $u \in N (v)$ such…

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…

math.CO2023

Computation of Grundy dominating sequences in (co-)bipartite graphs

Boštjan Brešar, Arti Pandey, Gopika Sharma

A sequence $S$ of vertices of a graph $G$ is called a dominating sequence of $G$ if $(i)$ each vertex $v$ of $S$ dominates a vertex of $G$ that was not dominated by any of the vert…

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

Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes

Gopika Sharma, Arti Pandey, Michael C. Wigal

For a given graph $G$ , a maximum internal spanning tree of $G$ is a spanning tree of $G$ with maximum number of internal vertices. The Maximum Internal Spanning Tree (MIST) problem…

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…

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