Extending the metric dimension to graphs with missing edges
From MaRDI portal
Publication:897908
DOI10.1016/J.TCS.2015.10.022zbMATH Open1331.05068DBLPjournals/tcs/ZejnilovicMGS16OpenAlexW2195053403WikidataQ59236781 ScholiaQ59236781MaRDI QIDQ897908FDOQ897908
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Resolvability in graphs and the metric dimension of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Landmarks in graphs
- On the Complexity of Metric Dimension
- Boundary vertices in graphs
- Approximability of the minimum weighted doubly resolving set problem
- Metric dimension for random graphs
- Some structural, metric and convex properties on the boundary of a graph
Cited In (4)
- 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
- Computing edge version of metric and double metric dimensions of kayak paddle graphs
- The metric dimension of two-dimensional extended meshes
This page was built for publication: Extending the metric dimension to graphs with missing edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897908)