Leaves on trees

By N. Duncan. 2014

932 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

On the Local Metric Dimension of Corona Product Graphs (2013, background): “Motivated by the problem of uniquely determining the location of an intruder in a network, the concept of metric dimension of a graph was introduced by Slater in [18], where the metric generators were called locating sets.”
Fault-Tolerant Resolvability and Extremal Structures of Graphs (2019, background): “In 1975, Slater [1] introduced the concept of a resolving set and its minimality within the graph, known as the metric dimension.”
Minimal doubly resolving sets and the strong metric dimension of Hamming graphs (2012, methodology): “The metric dimension problem, introduced independently by Slater [22] and Harary [8], has been widely investigated [1,3,5-7,9-13].”
The k-metric dimension of a graph (2013, background): “Moreover, 1-metric generators are the standard metric generators (resolving sets or locating sets as defined in [9] or [19], respectively).”