Charan Barman, Sambhu, Amita Samanta Adhya, Sukumar Mondal, and Jonecis Dayap. “Computation of Minimum $d$-Hop Connected Dominating Set of Trees in $O(n)$ Time”. Journal of Algebra Combinatorics Discrete Structures and Applications 9, no. 3 (July 9, 2022): 133–147. Accessed September 12, 2026. https://jacodesmath.com/index.php/jacodesmath/article/view/160.