Mathematics – Combinatorics
Scientific paper
2000-10-04
Mathematics
Combinatorics
16 pages
Scientific paper
We prove several criteria for quasi-isometry between non-locally-finite
graphs and their structure trees. Results of M\"oller in \cite{moeller92ends2}
for locally finite and transitive graphs are generalized. We also give a
criterion which describes quasi-isometry by how edge-ends are split up by the
cuts of a structure tree.
No associations
LandOfFree
Quasi-isometries between non-locally-finite graphs and structure trees 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 Quasi-isometries between non-locally-finite graphs and structure trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quasi-isometries between non-locally-finite graphs and structure trees will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-328213