Resolving the hypercube

DOI10.1016/j.dam.2013.02.012zbMath1286.05111OpenAlexW2082772405MaRDI QIDQ2446831

Alan F. Beardon

Publication date: 22 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.02.012

zbMATH Keywords

hypercubemetric dimensionresolving sets

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items

Is it possible to determine a point lying in a simplex if we know the distances from the vertices?, Unnamed Item, \( [ 1 , 2 \)-dimension of graphs], Resolvability of Hamming Graphs, On the metric dimension of incidence graphs, On the metric dimension of imprimitive distance-regular graphs

Cites Work

• Computing the metric dimension of graphs by genetic algorithms
• Resolvability in graphs and the metric dimension of a graph
• Base size, metric dimension and other invariants of groups and graphs
• On the Metric Dimension of Cartesian Products of Graphs
• Matroid Automorphisms and Symmetry Groups
• On a Combinatorial Problem in Number Theory
• Distance Sets in Metric Spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item