References
- G. Chartrand, E. Salehi and P. Zhang, The partition dimension of a graph, Aequationes Math. 59 (2000), 45–54. doi: 10.1007/PL00000127
- M. Fehr, S. Gosselin and O.R. Oellermann, The partition dimension of Cayley digraphs, Aequationes Math. 71 (2006), 1–18. doi: 10.1007/s00010-005-2800-z
- C. Grigorious, S. Stephen, R. Rajan and M. Miller, On the partition dimension of circulant graphs, Computer Journal 60 (2017), 180–184.
- C. Grigorious, S. Stephen, B. Rajan, M. Miller and A. William, On the partition dimension of a class of circulant graphs, Inform. Process. Lett. 114 (2014), 353–356. doi: 10.1016/j.ipl.2014.02.005
- I. Javaid, N. Khalid Raja, M. Salman and M. Naeem Azhar, The partition dimension of circulant graphs, World Appl. Sci. J. 18 (2012), 1705–1717.
- S. Khuller, B. Raghavachari and A. Rosenfeld, Landmarks in graphs, Discrete Appl. Math. 70 (1996), 217–229. doi: 10.1016/0166-218X(95)00106-2
- M. Salman, I. Javaid and M.A. Chaudhry, Resolvability in circulant graphs, Acta Math. Sin. (Engl. Ser.) 28 (2012), 1851–1864. doi: 10.1007/s10114-012-0417-4
- H.M.A. Siddiqui and M. Imran, Computation of metric dimension and partition dimension of nanotubes, J. Comput. Theor. Nanosci. 12 (2015), 199–203. doi: 10.1166/jctn.2015.3717
- P.J. Slater, Leaves of trees, Congr. Numer. 14 (1975), 549–559.
- I. Tomescu, Discrepancies between metric dimension and partition dimension of a connected graph, Discrete Math. 308 (2008), 5026–5031. doi: 10.1016/j.disc.2007.08.089
- I.G. Yero, M. Jakovac, D. Kuziak and A. Taranenko, The partition dimension of strong product graphs and Cartesian product graphs, Discrete Math. 331 (2014), 43–52. doi: 10.1016/j.disc.2014.04.026