Sangam Balchandar Reddy

activity

20232026

collaborators

6 papers

cs.DS2026

On the Complexity of Signed Domination

Sangam Balchandar Reddy

Given a graph $G = (V, E)$ , a signed dominating function is a function $f : V \to {- 1, 1}$ such that for every vertex $u \in V$ , $v \in N [u] \sum f (v) \geq 1$ . Th…

math.CO2026

On the complexity of global Roman domination problem in graphs

Sangam Balchandar Reddy, Arun Kumar Das, Anjeneya Swami Kare +1

A Roman dominating function of a graph $G = (V, E)$ is a labeling $f : V \to {0, 1, 2}$ such that for each vertex $u \in V$ with $f (u) = 0$ , there exists a vertex $v \in N(…

cs.DS2025

On the Complexity of Signed Roman Domination

Sangam Balchandar Reddy

Given a graph $G = (V, E)$ , a signed Roman dominating function is a function $f : V \to {- 1, 1, 2}$ such that for every vertex $u \in V$ : $\sum_{v \in N [u]} f (v) \geq 1$ a…

cs.CC2025

Hardness and Algorithmic Results for Roman \{3\}-Domination

Sangam Balchandar Reddy

A Roman ${3}$ -dominating function on a graph $G = (V, E)$ is a function $f : V \to {0, 1, 2, 3}$ such that for each vertex $u \in V$ , if $f (u) = 0$ then $\sum_{v \in N(u…

cs.DS2024

Algorithms for Minimum Membership Dominating Set Problem

Sangam Balchandar Reddy, Anjeneya Swami Kare

Given a graph $G = (V, E)$ and an integer $k$ , the Minimum Membership Dominating Set problem asks to compute a set $S \subseteq V$ such that for each $v \in V$ , $1 \leq |N[v] \cap…

cs.DS2023

On the Tractability of Defensive Alliance Problem

Sangam Balchandar Reddy, Anjeneya Swami Kare

Given a graph $G = (V, E)$ , a non-empty set $S \subseteq V$ is a defensive alliance, if for every vertex $v \in S$ , the majority of its closed neighbours are in $S$ , that is, $|N_G…