# On the robustness of the metric dimension of grid graphs to adding a single edge

```@article{Mashkaria2022OnTR,
title={On the robustness of the metric dimension of grid graphs to adding a single edge},
author={Satvik Mashkaria and Gergely {\'O}dor and Patrick Thiran},
journal={Discret. Appl. Math.},
year={2022},
volume={316},
pages={1-27}
}```
• Published 21 October 2020
• Mathematics, Computer Science
• Discret. Appl. Math.
1 Citations

## Figures and Tables from this paper

Metric dimension of growing infinite graphs
• Mathematics
• 2022
. We investigate how the metric dimension of inﬁnite graphs change when we add edges to the graph. Our two main results: (1) there exists a growing sequence of graphs (under the subgraph relation,

## References

SHOWING 1-10 OF 48 REFERENCES
Sequential metric dimension for random graphs
• Computer Science
Journal of Applied Probability
• 2021
This work finds that, in connected Erdős–Rényi graphs, the MD and the SMD are a constant factor apart, and shows that a strategy that greedily minimizes the number of candidate targets in each step uses asymptotically optimal queries in Erd� Hungarian graphs.
The effect of vertex or edge deletion on the metric dimension of graphs
• Mathematics
• 2015
The metric dimension dim(G) of a graph G is the minimum cardinality of a set of vertices such that every vertex of G is uniquely determined by its vector of distances to the chosen vertices. Let v
On Metric Generators of Graphs
• Mathematics, Computer Science
Math. Oper. Res.
• 2004
Results on the detection of false coins are used to approximate the metric dimension (minimum size of a generator for the metric space defined by the distances) of some particular graphs for which the problem was known and open and the existence of connected joins in graphs can be solved in polynomial time.
A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• Mathematics
• 2014
The metric dimension dim(G) of a graph G is the minimum number of vertices such that every vertex of G is uniquely determined by its vector of distances to the chosen vertices. The zero forcing
On the metric dimension of HDN 3 and PHDN 3
• Mathematics
2017 IEEE International Conference on Power, Control, Signals and Instrumentation Engineering (ICPCSI)
• 2017
Let M = {m1, m2,…, mp} be an ordered set of vertices in a graph G(V, E). Then (d(u, m1), d(u, m2),…, d(u, mp)) is called the p-dimensional vector of distances coordinate or p-coordinate of a vertex u
Landmarks in torus networks
• Mathematics, Computer Science
• 2006
It is proved that for torus TR(m, n), m≤n, the minimum metric dimension is 3 when at least one of m or n is odd and an upper bound is provided for theminimum metric dimension when both m and n are even.