Charan Barman, S., Amita Samanta Adhya, Sukumar Mondal, & 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–147. https://doi.org/10.13069/jacodesmath.v9i3.160