A characterization of some graphs with metric dimension two

DOI10.1142/S1793830917500276zbMath1362.05111arXiv1509.02129MaRDI 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

zbMATH Keywords

\(k\)-tree; resolving set; metric dimension; metric basis

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C12: Distance in graphs

Related Items

Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension, Metric dimension of Andrásfai graphs, Some classifications of graphs with respect to a set adjacency relation, Computing vertex resolvability of some regular planar graphs, Metric dimension of maximal outerplanar graphs, Further contributions on the outer multiset dimension of graphs

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