[1]
S. Charan Barman, Amita Samanta Adhya, Sukumar Mondal, and Jonecis Dayap, “Computation of minimum $d$-hop connected dominating set of trees in $O(n)$ time”, J. Algebra Comb. Discrete Struct. Appl., vol. 9, no. 3, pp. 133–147, Jul. 2022.