
doi: 10.37236/244
handle: 11421/17966
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.
natural intrinsic metric, Gromov-Hausdorff metric, positively weighted graphs, lower bound, equivalent graphs, Metric geometry, minimal weights, Planar graphs; geometric and topological aspects of graph theory
natural intrinsic metric, Gromov-Hausdorff metric, positively weighted graphs, lower bound, equivalent graphs, Metric geometry, minimal weights, Planar graphs; geometric and topological aspects of graph theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
