کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4647711 | 1342369 | 2013 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Gromov hyperbolic graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In this paper we prove that the study of the hyperbolicity on graphs can be reduced to the study of the hyperbolicity on simpler graphs. In particular, we prove that the study of the hyperbolicity on a graph with loops and multiple edges can be reduced to the study of the hyperbolicity in the same graph without its loops and multiple edges; we also prove that the study of the hyperbolicity on an arbitrary graph is equivalent to the study of the hyperbolicity on a 3-regular graph obtained from it by adding some edges and vertices. Moreover, we study how the hyperbolicity constant of a graph changes upon adding or deleting finitely or infinitely many edges.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 313, Issue 15, 6 August 2013, Pages 1575–1585
Journal: Discrete Mathematics - Volume 313, Issue 15, 6 August 2013, Pages 1575–1585
نویسندگان
Sergio Bermudo, José M. Rodríguez, José M. Sigarreta, Jean-Marie Vilaire,