Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: strong metric dimension

Sortuj według:

Ogranicz wyniki do:

Closed Formulae for the Strong Metric Dimension of Lexicographi

100%

Kuziak D., Yero I. G., Rodríguez-Velázquez J. A.

Discussiones Mathematicae Graph Theory

2016

tom 36

nr 4

1051-1064

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Kuziak D.

1 Rodríguez-Velázquez J. A.

1 Yero I. G.

1 2016

Wyniki wyszukiwania

Closed Formulae for the Strong Metric Dimension of Lexicographi