Closed Formulae for the Strong Metric Dimension of Lexicographi

• Autorzy: Dorota Kuziak , Ismael G. Yero , Juan A. Rodríguez-Velázquez
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

strong metric dimension; strong metric basis; strong metric generator; lexicographic product graphs

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2016
• Tom: 36
• Numer: 4
• Strony: 1051-1064

Daty

wydano

2016-11-01

online

2016-10-21

Twórcy

autor

Dorota Kuziak

• Departament d’Enginyeria Informàtica i Matemàtiques Universitat Rovira i Virgili Av. Països Catalans 26, 43007 Tarragona,

autor

Ismael G. Yero

• Departamento de Matemáticas, Universidad de Cádiz Av. Ramón Puyol s/n, 11202 Algeciras,

autor

Juan A. Rodríguez-Velázquez

• Departament d’Enginyeria Informàtica i Matemàtiques Universitat Rovira i Virgili Av. Països Catalans 26, 43007 Tarragona,

Identyfikatory

DOI

10.7151/dmgt.1911