Author(s) |
Title of Paper |
Journal |
Volume (No.) |
Page numbers |
Year |
Jakkepalli Pavan Kumar, P. Venkata Subba Reddy |
Algorithmic Aspects of 2-Secure Domination in Graphs |
Journal of Combinatorial Optimization |
42 |
56-70 |
2021 |
Jakkepalli Pavan Kumar, P. Venkata Subba Reddy |
Algorithmic Aspects of Secure Connected Domination in Graphs |
Discussiones Mathematicae Graph Theory |
41(4) |
1179-1197 |
2021 |
Jakkepalli Pavan Kumar, P. Venkata Subba Reddy |
Algorithmic Aspects of Some Variants of Domination in Graphs |
Analele Universitatii “Ovidius” Constanta-Seria Matematica |
28(3) |
153-170 |
2020 |
Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam |
Algorithmic Complexity of Secure Connected Domination in Graphs |
AKCE International Journal of Graphs and Combinatorics |
17(3) |
1010-1013 |
2020 |
Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, Himanshu K, S. Arumugam |
Algorithmic Aspects of Certified Domination in Graphs |
Communications in Combinatorics and Optimization |
7(2) |
247-255 |
2022 |
Jakkepalli Pavan Kumar, P. Venkata Subba Reddy |
Algorithmic Complexity of Isolate Secure Domination in Graphs |
TWMS Journal of Applied and Engineering Mathematics |
11(Special Issue) |
188-194 |
2021 |
A Sharma, Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam |
Algorithmic Aspects of Outer-Independent Roman Domination in Graphs |
Discrete Mathematics, Algorithms and Applications |
14(5) |
2250004-1 to 2250004-8 |
2022 |
Amit Sharma, P.Venkata Subba Reddy, S. Arumugam, Jakkepalli Pavan Kumar |
Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs |
International Journal of Foundations of Computer Science |
Accepted (Online Ready) |
|
2024 |