کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8966131 | 1646774 | 2019 | 4 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Infinite family of 2-connected transmission irregular graphs
ترجمه فارسی عنوان
خانواده بی نهایت از انتقال 2 اتصال انتقال نامحدود نمودار
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
چکیده انگلیسی
Distance between two vertices is the number of edges in the shortest path connecting them in a connected graph G. The transmission of a vertex v is the sum of distances from v to all the other vertices of G. If transmissions of all vertices are mutually distinct, then G is a transmission irregular graph. It is known that almost no graphs are transmission irregular. Infinite families of transmission irregular trees were presented in [4]. The following problem was posed in [4]: do there exist infinite families of 2-connected transmission irregular graphs? In this paper, an infinite family of such graphs is constructed.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 340, 1 January 2019, Pages 1-4
Journal: Applied Mathematics and Computation - Volume 340, 1 January 2019, Pages 1-4
نویسندگان
Andrey A. Dobrynin,