Algorithmic complexity of weakly connected Roman domination in graphs

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]

Abstract

Abstract is missing.