Strong metric dimension: A survey

Authors

  • Jozef Kratica Serbian Academy of Sciences and Arts, Mathematical Institute, Belgrade, Serbia
  • Vera Kovačević-Vujčić University of Belgrade, Faculty of Organizational Sciences, Belgrade, Serbia
  • Mirjana Čangalović University of Belgrade, Faculty of Organizational Sciences, Belgrade, Serbia
  • Nenad Mladenović Brunel University, Department of Mathematics, London, UK

DOI:

https://doi.org/10.2298/YJOR130520042K

Keywords:

strong metric dimension, graph problems, combinatorial optimization

Abstract

The strong metric dimension has been a subject of considerable amount of research in recent years. This survey describes the related development by bringing together theoretical results and computational approaches, and places the recent results within their historical and scientific framework.

References

Harary, F., Melter, R.A., On the metric dimension of a graph, Ars Combinatoria, 2 (1976) 191-195.

Kratica, J., Kovačević-Vujčić, V., Čangalović, M., Computing strong metric dimension of some special classes of graphs by genetic algorithms, Yugoslav Journal of Operations Research, 18 (2) (2008) 143-151.

Kratica, J., Kovačević-Vujčić, V., Čangalović, M., Stojanović, M., Minimal doubly resolving sets and the strong metric dimension of Hamming graphs, Applicable Analysis and Discrete Mathematics, 6 (1) (2012) 63-71.

Kratica, J., Kovačević-Vujčić, V., Čangalović, M., Stojanović, M., Minimal doubly resolving sets and the strong metric dimension of some convex polytopes, Applied Mathematics and Computation, 218 (2012) 9790-9801.

Kratica, J., Kovačević-Vujčić, V., Čangalović, M., An electromagnetism-like method for the strong metric dimension problem, Proceeding of the XXXIX Symposium on the Operations Research, Tara, Serbia, 2012, 351-354.

Kuziak, D., Yero, I.G., Rodríguez-Velázquez, J.A., On the strong metric dimension of corona product graphs and join graphs, Discrete Applied Mathematics, 161 (7-8) (2013) 1022-1027.

May, T., Oellermann, O.R., The strong metric dimension of distance-hereditary graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, 76 (2011) 59-73.

Mladenović, N., Kratica, J., Kovačević-Vujčić, V., Čangalović, M., Variable neighborhood search for the strong metric dimension problem, Electronic Notes in Discrete Mathematics, 39 (2012) 51-57.

Oellermann, O., Peters-Fransen, J., The strong metric dimension of graphs and digraphs, Discrete Applied Mathematics, 155 (2007) 356-364.

Rodríguez-Velázquez, J.A., Yero, I.G., Kuziak, D., Oellermann, O., On the strong metric dimension of Cartesian and direct product of graphs, submitted, arXiv:1307.4722v1, 17.07.2013 http://arxiv.org/pdf/1307.4722v1

Sebö, A., Tannier, E., On metric generators of graphs, Mathematics & Operations Research, 29(2) (2004) 383-393.

Slater, P.J., Leaves of trees, Congr. Numerantium, 14 (1975) 549-559.

Downloads

Published

2014-06-01

Issue

Vol. 24 No. 2 (2014)

Section

Research Articles

License

Copyright (c) 2014 YUJOR

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.