Author, as appears in the article.: Rodriguez-Velazquez, Juan A; Kuziak, Dorota; Yero, Ismael G; Sigarreta, Jose M
Department: Enginyeria Informàtica i Matemàtiques
URV's Author/s: Rodríguez Velázquez, Juan Alberto
Keywords: Strong product graph Resolving set Metric generator Metric dimension Metric basis
Abstract: For an ordered subset S = {s1; s2; ¿ sk} of vertices in a connected graph G, the metric representation of a vertex u with respect to the set S is the k-vector r(u|S) = (dG(v, s1); dG(v; s2); ¿; dG(v; sk)), where dG(x; y) represents the distance between the vertices x and y. The set S is a metric generator for G if every two different vertices of G have distinct metric representations with respect to S. A minimum metric generator is called a metric basis for G and its cardinality, dim(G), the metric dimension of G. It is well known that the problem of finding the metric dimension of a graph is NP-Hard. In this paper we obtain closed formulae and tight bounds for the metric dimension of strong product graphs. © 2015, North University of Baia Mare. All rights reserved.
Thematic Areas: Mathematics, applied Mathematics (miscellaneous) Mathematics (all) Mathematics General mathematics
licence for use: https://creativecommons.org/licenses/by/3.0/es/
Author's mail: juanalberto.rodriguez@urv.cat
Author identifier: 0000-0002-9082-7647
Record's date: 2024-10-26
Papper version: info:eu-repo/semantics/publishedVersion
Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
Papper original source: Carpathian Journal Of Mathematics. 31 (2): 261-268
APA: Rodriguez-Velazquez, Juan A; Kuziak, Dorota; Yero, Ismael G; Sigarreta, Jose M (2015). The metric dimension of strong product graphs. Carpathian Journal Of Mathematics, 31(2), 261-268
Entity: Universitat Rovira i Virgili
Journal publication year: 2015
Publication Type: Journal Publications
Repositori URV