Stability of graphs
The electronic journal of combinatorics, Tome 16 (2009) no. 1
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.
DOI :
10.37236/244
Classification :
05C10, 51F99
Mots-clés : positively weighted graphs, natural intrinsic metric, lower bound, minimal weights, Gromov-Hausdorff metric, equivalent graphs
Mots-clés : positively weighted graphs, natural intrinsic metric, lower bound, minimal weights, Gromov-Hausdorff metric, equivalent graphs
@article{10_37236_244,
author = {B\"unyamin Demir and Ali Deniz and \c{S}ahin Ko\c{c}ak},
title = {Stability of graphs},
journal = {The electronic journal of combinatorics},
year = {2009},
volume = {16},
number = {1},
doi = {10.37236/244},
zbl = {1159.05015},
url = {http://geodesic.mathdoc.fr/articles/10.37236/244/}
}
Bünyamin Demir; Ali Deniz; Şahin Koçak. Stability of graphs. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/244
Cité par Sources :