Resolvability in graphs and the metric dimension of a graph
Discrete Applied Mathematics
Matroid Automorphisms and Symmetry Groups
Combinatorics, Probability and Computing
On the Metric Dimension of Cartesian Products of Graphs
SIAM Journal on Discrete Mathematics
Computing the metric dimension of graphs by genetic algorithms
Computational Optimization and Applications
| Hi-index | 0.04 |
In this partly expository article we use techniques from linear algebra to discuss the metric dimension of the hypercube in R^n. Our main result reduces the question of whether a set of vertices resolves the hypercube to the question of whether or not a set of linear equations has a non-trivial solution. Applications are then given which, in many cases, shorten known arguments.