Barman, S., Pal, M., & Mondal, S. (2020). An optimal algorithm for computing minimum \(k\)-hop dominating set of permutation graphs. Serdica Mathematical Journal, 46(1), 43–60. Retrieved from https://serdica.math.bas.bg/index.php/serdica/article/view/202