arXiv Analytics

Sign in

arXiv:2102.10916 [math.CO]AbstractReferencesReviewsResources

On Metric Dimensions of Hypercubes

Aleksander Kelenc, Aoden Teo Masa Toshi, Riste Skrekovski, Ismael G. Yero

Published 2021-02-22Version 1

The metric (resp. edge metric or mixed metric) dimension of a graph $G$, is the cardinality of the smallest ordered set of vertices that uniquely recognizes all the pairs of distinct vertices (resp. edges, or vertices and edges) of $G$ by using a vector of distances to this set. In this note we show two unexpected results on hypercube graphs. First, we show that the metric and edge metric dimension of $Q_d$ differ by only one for every integer $d$. In particular, if $d$ is odd, then the metric and edge metric dimensions of $Q_d$ are equal. Second, we prove that the metric and mixed metric dimensions of the hypercube $Q_d$ are equal for every $d \ge 3$. We conclude the paper by conjecturing that all these three types of metric dimensions of $Q_d$ are equal when $d$ is large enough.

Related articles: Most relevant | Search more
arXiv:1706.05550 [math.CO] (Published 2017-06-17)
The fractional $k$-metric dimension of graphs
arXiv:1608.05495 [math.CO] (Published 2016-08-19)
The fractional strong metric dimension in three graph products
arXiv:1708.05413 [math.CO] (Published 2017-08-17)
Escaping from the corner of a grid by edge disjoint paths