Given a connected graph G, a vertex w ∈ V (G) strongly resolves two vertices u, v ∈ V (G) if there exists some shortest u − w path containing v or some shortest v − w path containing u. A set S of vertices is a strong metric generator for G if every pair of vertices of G is strongly resolved by some vertex of S. The smallest cardinality of a strong metric generator for G is called the strong metric dimension of G. In this paper we obtain several relationships between the strong metric dimension of the lexicographic product of graphs and the strong metric dimension of its factor graphs.
@article{bwmeta1.element.doi-10_7151_dmgt_1911,
author = {Dorota Kuziak and Ismael G. Yero and Juan A. Rodr\'\i guez-Vel\'azquez},
title = {Closed Formulae for the Strong Metric Dimension of Lexicographi},
journal = {Discussiones Mathematicae Graph Theory},
volume = {36},
year = {2016},
pages = {1051-1064},
zbl = {1350.05024},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1911}
}
Dorota Kuziak; Ismael G. Yero; Juan A. Rodríguez-Velázquez. Closed Formulae for the Strong Metric Dimension of Lexicographi. Discussiones Mathematicae Graph Theory, Tome 36 (2016) pp. 1051-1064. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1911/