ABSTRACT
Given a connected graph , the distance
between two vertices
is the length of a shortest u−v path in G. The distance
between a vertex
and a subset
is defined as
. An ordered partition
of vertices of G is a resolving partition of G, if for any two different vertices u,v of G there exists
such that
. The partition dimension of G is the minimum number of sets in any resolving partition of G. In this article, we study the partition dimension of the lexicographic product of two graphs.
Disclosure statement
No potential conflict of interest was reported by the authors.
ORCID
I.G. Yero http://orcid.org/0000-0002-1619-1572