Minimum weight resolving sets of grid graphs

DOI10.1142/S1793830916500488zbMath1345.05020arXiv1409.4510OpenAlexW1825173856MaRDI QIDQ2821114

Cyriac Grigorious, Patrick J. Andersen, Mirka Miller

Publication date: 16 September 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.4510

zbMATH Keywords

grid graphsresolving setsweighted metric dimension

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (2)

3-total edge product cordial labeling of rhombic grid ⋮ On 3-total edge product cordial labeling of grid

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Resolvability in graphs and the metric dimension of a graph
• Landmarks in graphs
• On the metric dimension of some families of graphs
• Metric bases in digital geometry
• The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Minimum weight resolving sets of grid graphs