Extending the metric dimension to graphs with missing edges

DOI10.1016/j.tcs.2015.10.022zbMath1331.05068OpenAlexW2195053403WikidataQ59236781 ScholiaQ59236781MaRDI QIDQ897908

N. E. Zubov

Publication date: 8 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.022

zbMATH Keywords

tree graphgridmetric dimensioncycle graphgraph boundary

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (2)

On the robustness of the metric dimension of grid graphs to adding a single edge ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metric dimension for random graphs
• Resolvability in graphs and the metric dimension of a graph
• Boundary vertices in graphs
• Landmarks in graphs
• On the Complexity of Metric Dimension
• Approximability of the Minimum Weighted Doubly Resolving Set Problem
• Some structural, metric and convex properties on the boundary of a graph

This page was built for publication: Extending the metric dimension to graphs with missing edges