A set S of vertices in a graph G resolves G if every vertex is uniquely
determined by its vector of distances to the vertices in S. The metric
dimension of G is the minimum cardinality of a resolving set of G. This paper
studies the metric dimension of cartesian products G*H. We prove that the
metric dimension of G*G is tied in a strong sense to the minimum order of a
so-called doubly resolving set in G. Using bounds on the order of doubly
resolving sets, we establish bounds on G*H for many examples of G and H. One of
our main results is a family of graphs G with bounded metric dimension for
which the metric dimension of G*G is unbounded
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.