Cite
Roman {3}-domination in graphs: Complexity and algorithms.
MLA
Chaudhary, Juhi, and Dinabandhu Pradhan. “Roman {3}-Domination in Graphs: Complexity and Algorithms.” Discrete Applied Mathematics, vol. 354, Sept. 2024, pp. 301–25. EBSCOhost, https://doi.org/10.1016/j.dam.2022.09.017.
APA
Chaudhary, J., & Pradhan, D. (2024). Roman {3}-domination in graphs: Complexity and algorithms. Discrete Applied Mathematics, 354, 301–325. https://doi.org/10.1016/j.dam.2022.09.017
Chicago
Chaudhary, Juhi, and Dinabandhu Pradhan. 2024. “Roman {3}-Domination in Graphs: Complexity and Algorithms.” Discrete Applied Mathematics 354 (September): 301–25. doi:10.1016/j.dam.2022.09.017.