Resolvability in graphs and the metric dimension of a graph

2000/10/01 by Gary Chartrand, Linda Eroh, Mark A. Johnson +1 · 15 citations
Computer Science · Mathematics · #Combinatorics #Connectivity #Dimension (graph theory) #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Line graph #Mathematics #Metric dimension #Pathwidth #Vertex (graph theory)

paper · pdf · doi:10.1016/s0166-218x(00)00198-0

crossref issued 2000/10/01 · crossref published 2000/10/01 · crossref published-print 2000/10/01 · openalex publication_date 2000/10/01 · crossref created 2002/07/25 · crossref deposited 2019/04/28 · openalex created_date 2025/10/10 · crossref indexed 2026/07/07 · openalex updated_date 2026/08/01

Cited by

• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• Approximation complexity of Metric Dimension problem
• On the Complexity of Metric Dimension
• The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
• Metric Dimension of Bounded Width Graphs
• Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension
• On k-dimensional graphs and their bases
• Computing the metric dimension for chain graphs
• On the metric dimension of line graphs
• Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity
• Identification, location–domination and metric dimension on interval and permutation graphs. I. Bounds
• Extremal Graph Theory for Metric Dimension and Diameter
• Broadcast Dimension of Graphs
• Resolving sets for Johnson and Kneser graphs
• Metric dimension (graph theory) [wikipedia]