The Electronic Journal of Combinatorics · 2010 · 41 citations · 16 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsGeometryEnumerative CombinatoricsGeometric GraphsGraph AlgorithmsGraph TheoryMetric GeometryComputational Complexity Of Graph AlgorithmsEnumerative Graph TheoryGeometric Graph TheoryGraph DiameterGraph EnumerationLower BoundsMetric Graph Theory
This paper initiates a study on the problem of computing the difference between the metric dimension and the determining number of graphs. We provide new proofs and results on the determining number of trees and Cartesian products of graphs, and establish some lower bounds on the difference between the two parameters.
16
Resolvability in graphs and the metric dimension of a graph
Gary Chartrand, Linda Eroh, Mark A. Johnson et al. · Discrete Applied Mathematics · 2000 · 982 citations
Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld · Discrete Applied Mathematics · 1996 · 808 citations
On the Metric Dimension of Cartesian Products of Graphs
José Cáceres, Carmen Hernando, Mercè Ferrater Mora et al. · SIAM Journal on Discrete Mathematics · 2007 · 474 citations · Full text
Michael O. Albertson, Karen L. Collins · The Electronic Journal of Combinatorics · 1996 · 272 citations · Full text
Spanning trees and optimization problems
Choice Reviews Online · 2004 · 238 citations