Jakkepalli Pavan Kumar

According to our database, Jakkepalli Pavan Kumar authored at least 8 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs.

Amit Sharma, P. Venkata Subba Reddy, Subramanian Arumugam, Jakkepalli Pavan Kumar

Int. J. Found. Comput. Sci., January, 2025

2022

Algorithmic aspects of outer independent Roman domination in graphs.

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

Discret. Math. Algorithms Appl., 2022

2021

Algorithmic aspects of 2-secure domination in graphs.

Jakkepalli Pavan Kumar, Venkata Subba Reddy Palagiri

J. Comb. Optim., 2021

Algorithmic aspects of secure connected domination in graphs.

Jakkepalli Pavan Kumar, P. Venkata Subba Reddy

Discuss. Math. Graph Theory, 2021

2020

Algorithmic Complexity of Isolate Secure Domination in Graphs.

Jakkepalli Pavan Kumar, P. Venkata Subba Reddy

CoRR, 2020

Algorithmic Aspects of Some Variants of Domination in Graphs.

Jakkepalli Pavan Kumar, P. Venkata Subba Reddy

CoRR, 2020

Algorithmic complexity of secure connected domination in graphs.

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

AKCE Int. J. Graphs Comb., 2020

2017

Complexity Issues of Variants of Secure Domination in Graphs.

Devendra Lad, P. Venkata Subba Reddy, Jakkepalli Pavan Kumar

Electron. Notes Discret. Math., 2017