J. P. Kumar

most citedAlgorithmic Aspects of Secure Connected Domination in Graphs

6 citations · 13 across the 4 of their papers we have counts for

collaborators

4 papers

cs.DM2020

Algorithmic Complexity of Isolate Secure Domination in Graphs

Jakkepalli Pavan Kumar, P. Venkata Subba Reddy

A dominating set $S$ is an Isolate Dominating Set (IDS) if the induced subgraph $G [S]$ has at least one isolated vertex. In this paper, we initiate the study of new domination para…

cs.DM2020

Algorithmic Aspects of Some Variants of Domination in Graphs

Jakkepalli Pavan Kumar, P. Venkata Subba Reddy

A set $S \subseteq V$ is a dominating set in G if for every u \in V \ S, there exists $v \in S$ such that $(u, v) \in E$ , i.e., $N [S] = V$ . A dominating set $S$ is an Isolate Domina…

cs.DM2020★ 1 cited

Algorithmic Complexity of Secure Connected Domination in Graphs

Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam

Let $G = (V, E)$ be a simple, undirected and connected graph. A connected (total) dominating set $S \subseteq V$ is a secure connected (total) dominating set of $G$ , if for each $ u…

cs.DM2020★ 6 cited

Algorithmic Aspects of Secure Connected Domination in Graphs

Jakkepalli Pavan Kumar, P. Venkata Subba Reddy

Let $G = (V, E)$ be a simple, undirected and connected graph. A connected dominating set $S \subseteq V$ is a secure connected dominating set of $G$ , if for each $ u \in V\setminus…