1. The k-metric dimension;Adar;J. Comb. Optim.,2016
2. The weighted 2-metric dimension of trees in the non-landmarks model;Adar;Discret. Optim.,2015
3. On the metric dimension of Grassmann graphs;Bailey;Discre. Math. Theor. Comput. Sci.,2011
4. R.F. Bailey, I.G. Yero, Error-correcting codes from k-resolving sets, arXiv:1605.03141 [math.CO].
5. Resolving domination in graphs;Brigham;Mathematica Bohemica,2003