Back to Search
Start Over
Graph topologies induced by edge lengths
- Source :
-
Discrete Mathematics . Aug2011, Vol. 311 Issue 15, p1523-1542. 20p. - Publication Year :
- 2011
-
Abstract
- Abstract: Let be a graph each edge of which is given a length . This naturally induces a distance between any two vertices , and we let  denote the completion of the corresponding metric space. It turns out that several well-studied topologies on infinite graphs are special cases of . Moreover, it seems that is the right setting for studying various problems. The aim of this paper is to introduce , providing basic facts, motivating examples and open problems, and indicate possible applications. Parts of this work suggest interactions between graph theory and other fields, including algebraic topology and geometric group theory. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 311
- Issue :
- 15
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 60789366
- Full Text :
- https://doi.org/10.1016/j.disc.2011.02.012