References
- Basak, M., Saha, L., Das, G., Tiwary, K. (2020). Fault-tolerant metric dimension of circulant graphs Cn(1,2,3). Theor. Comput. Sci. 817: 66–79.
- Basak, M., Saha, L., Tiwary, K. (2019). Metric dimension of zero-divisor graph for the ring (Zn). Int. J. Sci. Res. Math. Stat. Sci. 6(1): 74–78.
- Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffmann, M., Mihal'ak, M., Ram, L. S. (2006). Network discovery and verification. IEEE J. Select. Areas Commun. 24(12): 2168–2181.
- Chartrand, G., Eroh, L., Johnson, M., Oellermann, O. (2000). Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math. 105(1–3): 99–113.
- Chvatal, V. (1983). Mastermind. Combinatorica. 3: 325–329.
- Hernando, C., Mora, M., Pelayo, I., Seara, C., Wood, D. (2010). Extremal graph theory for metric dimension and diameter. Electron. J. Combin. 17(1): 1–28.
- Harary, F., Melter, R. (1976). On the metric dimension of a graph. Ars Combin. 2: 191–195.
- Khuller, S., Raghavachari, B., Rosenfeld, A. (1996). Landmarks in graphs. Discrete Appl. Math. 70(3): 217–229.
- Saha, L. (2021). Fault-tolerant metric dimension of cube of paths. J. Phys. Conf. Ser. 1714(1): 012029.
- Slater, P. (1975). Leaves of trees. Cong. Numer. 14: 549–559.
- Tomescu, I., Melter, R. A. (1984). Metric bases in digital geometry. Comput. Vis. Graph. Image Process. 25(1): 113–121.