On the robustness of the metric dimension of grid graphs to adding a single edge
From MaRDI portal
Publication:2143039
DOI10.1016/j.dam.2022.02.014zbMath1490.05061arXiv2010.11023OpenAlexW3212221569MaRDI QIDQ2143039
Satvik Mashkaria, Patrick Thiran, Gergely Ódor
Publication date: 30 May 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.11023
Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The difference between the metric dimension and the determining number of a graph
- Metric dimension for random graphs
- Approximation complexity of metric dimension problem
- The effect of vertex or edge deletion on the metric dimension of graphs
- Extending the metric dimension to graphs with missing edges
- On the determining number and the metric dimension of graphs
- Resolvability in graphs and the metric dimension of a graph
- The threshold dimension of a graph
- Metric dimension of critical Galton-Watson trees and linear preferential attachment trees
- Extremal results for graphs of bounded metric dimension
- On the limiting distribution of the metric dimension for random forests
- A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
- Landmarks in graphs
- Base size, metric dimension and other invariants of groups and graphs
- Landmarks in torus networks
- On the Metric Dimension of Cartesian Products of Graphs
- Metric bases in digital geometry
- Random Graph Isomorphism
- Hiding the Rumor Source
- Fully dynamic all-pairs shortest paths with worst-case update-time revisited
- Sequential metric dimension for random graphs
- Rumors in a Network: Who's the Culprit?
- A new approach to dynamic all pairs shortest paths
- On Metric Generators of Graphs
This page was built for publication: On the robustness of the metric dimension of grid graphs to adding a single edge
