On the number of resolving pairs in graphs
type: Item
instance of: scholarly article
title: On the number of resolving pairs in graphs
zbMATH Open document ID: 1327.05087
author: Peter Dankelmann
published in: Graphs and Combinatorics
publication date: 2015-12-17T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6521770
zbMATH Keywords: distance
zbMATH Keywords: resolving pair
zbMATH Keywords: resolving set
zbMATH Keywords: metric dimension
MaRDI profile type: Publication
full work available at URL: s00373-014-1517-y
OpenAlex ID: W2127710189
cites work: On the Metric Dimension of Cartesian Products of Graphs
cites work: On the metric dimension of infinite graphs
cites work: Resolvability in graphs and the metric dimension of a graph
cites work: Q4119237
cites work: Extremal graph theory for metric dimension and diameter
cites work: Q4532377
cites work: Q4075485
cites work: Metric dimension and \(R\)-sets of connected graphs
cites work: Q5500105
DOI: 10.1007/S00373-014-1517-Y
description: scientific article; zbMATH DE number 6521770