Charan Barman, Sambhu, Amita Samanta Adhya, Sukumar Mondal, and Jonecis Dayap. 2022. “Computation of Minimum $d$-Hop Connected Dominating Set of Trees in $O(n)$ Time”. Journal of Algebra Combinatorics Discrete Structures and Applications 9 (3):133-47. https://doi.org/10.13069/jacodesmath.v9i3.160.