کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4657313 | 1343730 | 2008 | 20 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Quasi-isometries between graphs and trees
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Criteria for quasi-isometry between trees and general graphs as well as for quasi-isometries between metrically almost transitive graphs and trees are found. Thereby we use different concepts of thickness for graphs, ends and end spaces. A metrically almost transitive graph is quasi-isometric to a tree if and only if it has only thin metric ends (in the sense of Definition 3.6). If a graph is quasi-isometric to a tree then there is a one-to-one correspondence between the metric ends and those d-fibers which contain a quasi-geodesic. The graphs considered in this paper are not necessarily locally finite.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Combinatorial Theory, Series B - Volume 98, Issue 5, September 2008, Pages 994-1013
Journal: Journal of Combinatorial Theory, Series B - Volume 98, Issue 5, September 2008, Pages 994-1013