On the Metric Dimension of Infinite Graphs
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this paper we study the metric dimension of infinite graphs such that all its vertices have finite degree. We give necessary conditions for those graphs to have finite metric dimension and characterize infinite trees with finite metric dimension. We also establish some results about the metric dimension of the cartesian product of finite and infinite graphs, and give the metric dimension of the cartesian product of several families of graphs.
17 pages, 17 figures, 3 tables, 16 references
17 pages, 17 figures, 3 tables, 16 references