Resolvability and the upper dimension of graphs

By G. Chartrand, C. Poisson, Ping Zhang. 2000

147 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/a3d4486ecafe6ef2f1426d67dea1435c00e5b6fd

How researchers see this paper

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

In Computational Theory and Mathematics

1. Alejandro Estrada-Moreno
2. Juan A. Rodríguez-Velázquez
3. David R. Wood
4. Ismael González Yero

Citations in the corpus

• The k-metric dimension of a graph (2013, background): “Several variations of metric generators including resolving dominating sets [2], independent resolving sets [6], local metric sets [16], and strong resolving sets [14, 15, 18], etc.”
• The metric dimension of regular bipartite graphs (2011, background): “[4] have proved that the metric dimension of even cycle is 2.”
• On the Metric Dimension of Cartesian Products of Graphs (2005, background): “Resolving sets have since been widely investigated [4, 8, 9, 10, 11, 12, 14, 17, 18, 27, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 48] and arise in many diverse areas, including network discovery and verification [2], robot navigation [27, 41], connected joins in graphs [40], and strategies for th”