Charan Barman, S. (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), pp. 133–147. doi: 10.13069/jacodesmath.v9i3.160.