On the number of resolving pairs in graphs

DOI10.1007/S00373-014-1517-YMaRDI QIDQ897274zbMATH OpenOpenAlexFDO

Authors 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

distancemetric dimensionresolving setresolving pair

Mathematics Subject Classification ID

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

Recommendations

• On a conjecture concerning resolving pairs
• Resolvability and the upper dimension of graphs
• scientific article; zbMATH DE number 2197925
• Connected Resolvability of Graphs
• On the metric dimension, the upper dimension and the resolving number of graphs

Cites work

• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• scientific article; zbMATH DE number 1749658 (Why is no real title available?)
• Extremal graph theory for metric dimension and diameter
• Metric dimension and \(R\)-sets of connected graphs
• On metric dimension of uniform subdivisions of the wheel
• On the Metric Dimension of Cartesian Products of Graphs
• On the metric dimension of infinite graphs
• Resolvability in graphs and the metric dimension of a graph

Cited in

(2)

• On a conjecture concerning resolving pairs
• scientific article; zbMATH DE number 6542389 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897274)