- Tytuł:
- Closed Formulae for the Strong Metric Dimension of Lexicographic Product Graphs
- Autorzy:
-
Kuziak, Dorota
Yero, Ismael G.
Rodríguez-Velázquez, Juan A. - Powiązania:
- https://bibliotekanauki.pl/articles/31340465.pdf
- Data publikacji:
- 2016-11-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
strong metric dimension
strong metric basis
strong metric generator
lexicographic product graphs - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2016, 36, 4; 1051-1064
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł