论文信息 - Stability of Graphs

Stability of Graphs

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.

Bünyamin Demir | Ali Deniz | Sahin Koçak

[1] Andrzej Zak,et al. On vertex stability with regard to complete bipartite subgraphs , 2010, Discuss. Math. Graph Theory.

[2] M. Gromov. Metric Structures for Riemannian and Non-Riemannian Spaces , 1999 .

[3] Aneta Dudek,et al. (H, k) stable bipartite graphs with the minimum size , 2009, Discuss. Math. Graph Theory.

[4] V. Sós,et al. Counting Graph Homomorphisms , 2006 .

[5] Arcwise Isometries,et al. A Course in Metric Geometry , 2001 .

[6] V. Sós,et al. Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.

[7] Yu. D. Burago,et al. A direct proof of one Gromov's theorem , 2008, 0802.0098.