Cite
HARVARD Citation
Kumar, J. et al. (2020). Algorithmic complexity of secure connected domination in graphs. AKCE International Journal of Graphs and Combinatorics. 17 (3), pp. 1010-1013. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Kumar, J. et al. (2020). Algorithmic complexity of secure connected domination in graphs. AKCE International Journal of Graphs and Combinatorics. 17 (3), pp. 1010-1013. [Online].