Graph topologies induced by edge lengths

Details Graph topologies induced by edge lengths Graph topologies induced by edge lengths

2009-03-10

arxiv.org/abs/0903.1744v3

Mathematics

Combinatorics

Final version, to appear in special issue (Infinite graphs, Banff workshop) of Discrete Mathematics

Scientific paper

Let $G$ be a graph each edge $e$ of which is given a length $\ell(e)$. This naturally induces a distance $d_\ell(x,y)$ between any two vertices $x,y$, and we let $\ell-TOP$ denote the completion of the corresponding metric space. It turns out that several well studied topologies on infinite graphs are special cases of $\ell-TOP$. Moreover, it seems that $\ell-TOP$ is the right setting for studying various problems. The aim of this paper is to introduce $\ell-TOP$, providing basic facts, motivating examples and open problems, and indicate possible applications.

Affiliated with

Also associated with

No associations

Rating

Graph topologies induced by edge lengths does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graph topologies induced by edge lengths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph topologies induced by edge lengths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-187057