| Algorithmic complexity of secure connected domination in graphs JP Kumar, PVS Reddy, S Arumugam AKCE International Journal of Graphs and Combinatorics 17 (3), 1010-1013, 2020 | 7 | 2020 |
| Algorithmic aspects of secure connected domination in graphs JP Kumar, P Reddy Discussiones Mathematicae Graph Theory, 2020 | 5 | 2020 |
| Algorithmic aspects of certified domination in graphs PK Jakkepalli, S Arumugam, H Khandelwal Communications in Combinatorics and Optimization 7 (2), 247-255, 2022 | 4 | 2022 |
| Algorithmic aspects of outer independent Roman domination in graphs A Sharma, JP Kumar, PV Subba Reddy, S Arumugam Discrete Mathematics, Algorithms and Applications 14 (05), 2250004, 2022 | 3 | 2022 |
| Algorithmic aspects of 2-secure domination in graphs PK Jakkepalli, VSR Palagiri Journal of Combinatorial Optimization 42, 56-70, 2021 | 3 | 2021 |
| Complexity issues of variants of secure domination in graphs D Lad, PVS Reddy, JP Kumar Electronic Notes in Discrete Mathematics 63, 77-84, 2017 | 3 | 2017 |
| Algorithmic Complexity of Isolate Secure Domination in Graphs PVSR Jakkepalli Pavan Kumar TWMS Journal of Applied and Engineering Mathematics 11 (Special Issue), 188-194, 2021 | | 2021 |
| Algorithmic Aspects of Some Variants of Domination in Graphs J Pavan Kumar, P Subba Venkata Reddy Analele Universitatii “Ovidius” Constanta-Seria Matematica 28 (3), 153-170, 2020 | | 2020 |
| Algorithmic Aspects of Variants of Domination in Graphs JP Kumar Warangal, 0 | | |
Arumugam SKalasalingam UniversityVerified email at klu.ac.in
Arumugam SKalasalingam UniversityVerified email at klu.ac.in