On the number of resolving pairs in graphs

DOI10.1007/s00373-014-1517-yzbMath1327.05087OpenAlexW2127710189MaRDI QIDQ897274

Peter Dankelmann

Publication date: 17 December 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1517-y

zbMATH Keywords

distanceresolving setmetric dimensionresolving pair

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metric dimension and \(R\)-sets of connected graphs
• Resolvability in graphs and the metric dimension of a graph
• On the metric dimension of infinite graphs
• Extremal graph theory for metric dimension and diameter
• On the Metric Dimension of Cartesian Products of Graphs

This page was built for publication: On the number of resolving pairs in graphs