1.
Charan Barman S, Amita Samanta Adhya, Sukumar Mondal, Jonecis Dayap. Computation of minimum $d$-hop connected dominating set of trees in $O(n)$ time. J. Algebra Comb. Discrete Struct. Appl. [Internet]. 2022 Jul. 9 [cited 2026 Sep. 12];9(3):133-47. Available from: https://jacodesmath.com/index.php/jacodesmath/article/view/160