A characterization of some graphs with metric dimension two
From MaRDI portal
Publication:5347261
DOI10.1142/S1793830917500276zbMath1362.05111arXiv1509.02129OpenAlexW2963394749MaRDI QIDQ5347261
Behnaz Omoomi, Akbar Davoodi, Mohsen Jannesari, Ali Behtoei
Publication date: 23 May 2017
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.02129
Related Items (6)
Further contributions on the outer multiset dimension of graphs ⋮ Metric dimension of Andrásfai graphs ⋮ Computing vertex resolvability of some regular planar graphs ⋮ Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension ⋮ Metric dimension of maximal outerplanar graphs ⋮ Some classifications of graphs with respect to a set adjacency relation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel recognition of series-parallel graphs
- Resolvability in graphs and the metric dimension of a graph
- Landmarks in graphs
- Characterization of n-Vertex Graphs with Metric Dimension n-3
- On the Metric Dimension of Cartesian Products of Graphs
- Metric bases in digital geometry
- Distances in random Apollonian network structures
- On Metric Generators of Graphs
This page was built for publication: A characterization of some graphs with metric dimension two