Charan Barman, S. et al. 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 (Jul. 2022), 133–147. DOI:https://doi.org/10.13069/jacodesmath.v9i3.160.