On the number of resolving pairs in graphs

DOI10.1007/S00373-014-1517-YzbMATH Open1327.05087OpenAlexW2127710189MaRDI QIDQ897274FDOQ897274

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

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

zbMATH Keywords

distancemetric dimensionresolving setresolving pair

Mathematics Subject Classification ID

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

Cites Work

• Resolvability in graphs and the metric dimension of a graph
• On the Metric Dimension of Cartesian Products of Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Extremal graph theory for metric dimension and diameter
• On the metric dimension of infinite graphs
• Title not available (Why is that?)
• Metric dimension and \(R\)-sets of connected graphs
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

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)