CHARAN BARMAN, Sambhu; AMITA SAMANTA ADHYA; SUKUMAR MONDAL; JONECIS DAYAP. Computation of minimum $d$-hop connected dominating set of trees in $O(n)$ time. Journal of Algebra Combinatorics Discrete Structures and Applications, [S. l.], v. 9, n. 3, p. 133–147, 2022. DOI: 10.13069/jacodesmath.v9i3.160. Disponível em: https://jacodesmath.com/index.php/jacodesmath/article/view/160. Acesso em: 12 sep. 2026.