ELECTRONIC JOURNAL OF COMBINATORICS, vol.16, no.1, 2009 (SCI-Expanded)
Positively weighted graphs have a natural intrinsic metric. We consider finite, positively weighted graphs with a positive lower bound for their minimal weights and show that any two such graphs, which are close enough with respect to the Gromov-Hausdorff metric, are equivalent as graphs.