References
- Cáceres, J., Hernando, C., Mora, M., Pelayo, I. M., Puertas, M. L., Seara, C, Wood, D. R. (2007). On the metric dimension of Cartesian product of graphs. SIAM J. Discrete Math. 21(2): 423–441.
- Chartrand, G., Eroh, L., Johnson, M. A, Oellermann, O. R. (2000). Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math 105(1-3): 99–113.
- Chartrand, G, Lesniak, L. (2005). Graphs and Digraphs, 4th ed. Boca Raton: CRC.
- Chartrand, G., Saenpholphat, V, Zhang, P. (2003). The independent resolving number of a graph. Math. Bohem. 128(4): 379–393.
- Harary, F, Melter, R. A. (1976). On the metric dimension of a graph. ARS Combin. 2: 191–195.
- Imrich, W, Klavzar, S. (2000). Graph Products, Structure and Recognition, New York: John Wiley & Sons.
- Saenpholphat, V, Zhang, P. (2004). Conditional resolvability in graphs-A survey. Int. J. Math. Math. Sci. 2004(38): 1997–2017.
- Slater, P. J. (1975). Leaves of trees, Proceedings of the sixth Southeastern Conference on Combinatorics, Graph Theory and Computing. Cong. Numer. 14: 549–559.
- Yero, I. G., Kuziak, D, Rodríguez-Velázquez, J. A. (2011). On the metric dimension of corona product of graphs. Comput. Math. Appl. 61(9): 2793–2798.