[1] G. Chartrand, L. Eroh, M.A. Johnson and O.R. Oellermann, Resolvability in graphs and the metric dimension of
a graph, Discrete Appl. Math. 105 (2000) 99–113.
[2] F. Harary and R.A. Melter, On the metric dimension of a graph, Ars Combinatoria 2 (1976) 191–195.
[3] T. He and K. Shi, Rough graph and its structure, J. Shandong Univ. 41(6) (2006) 46–50.
[4] M. Imran, A.Q. Baig, S.A.U.H. Bokhary and I. Javaid, On the metric dimension of circulant graphs, Appl. Math.
Lett. 25(3) (2012) 320–325.
[5] M. Jannesari and B. Omoomi, The metric dimension of the lexicographic product of graphs, Discrete Math. 312
(2012) 3349–3356.
[6] X. Jia, Z. Tang, W. Liao and L. Shang, On an optimization representation of decision-theoretic Rough set model,
Int. J. Appr. Reas. 55(1) (2014) 156–166.
[7] B. Praba, P. Venugopal, P. Nammalwar, Metric dimension in fuzzy graphs-A novel approach, Appl. Math. Sci.
6(102) (2012) 5274–5283.
[8] Z. Shao, S.M. Sheikholeslami, P. Wu and J.-B. Liu, The metric dimension of some generalized Petersen graphs,
Discrete Dyn. Nature Soc. 2018 (2018) 1–10.
[9] P.J. Slater, Leaves of trees, Cong. Numerant.14(37) (1975) 549–559.
[10] B. Sooryanarayana, On the metric dimension of a graph, Indian J. Pure Appl. Math. 29(4) (1998) 413–415.
[11] W. Ziarko, Variable precision rough set model, J. Comput. Sys. Sci. 46(1) 39–59.