1.
Barman S, Pal M, Mondal S. An optimal algorithm for computing minimum \(k\)-hop dominating set of permutation graphs. Serdica Math. J. [Internet]. 2020 Jun. 22 [cited 2026 Oct. 29];46(1):43–60. Available from: https://serdica.math.bas.bg/index.php/serdica/article/view/202