Chakradhar Padamutham, P. Venkata Subba Reddy 0001, Khandelwal Himanshu. Algorithmic complexity of weakly connected Roman domination in graphs. Discrete Math., Alg. and Appl., 14(3), 2022. [doi]
@article{PadamuthamRH22,
title = {Algorithmic complexity of weakly connected Roman domination in graphs},
author = {Chakradhar Padamutham and P. Venkata Subba Reddy 0001 and Khandelwal Himanshu},
year = {2022},
doi = {10.1142/S1793830921501251},
url = {https://doi.org/10.1142/S1793830921501251},
researchr = {https://researchr.org/publication/PadamuthamRH22},
cites = {0},
citedby = {0},
journal = {Discrete Math., Alg. and Appl.},
volume = {14},
number = {3},
}