The theory and applications of resolvability in graphs: A survey

By G. Chartrand, Ping Zhang. 2003

125 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.

Fault-Tolerant Resolvability and Extremal Structures of Graphs (2019, background): “Chartrand [19] investigated certain applications by referring to components of a metric basis as sensors.”
On the Metric Dimension of Cartesian Products of Graphs (2005, background): “see, resolving sets in hypercubes were studied earlier under the guise of a coin weighing problem [1, 5, 6, 13, 14, 18, 20, 23, 24, 25, 26, 27, 37]. Resolving sets have since been widely investigated [4, 7, 8, 9, 10, 12, 21, 28, 29, 30, 31, 32, 33, 34, 36, 38, 39, 40], and arise in many diverse area”
Network Discovery and Verification (2005, result): “survey of known results, we refer to [19].”