Arti Pandey

collaborators

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