کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4949482 | 1440190 | 2017 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On extremal cacti with respect to the revised Szeged index
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The revised Szeged index of a graph G is defined as Szâ(G)=âe=uvâE(nu(e)+n0(e)2)(nv(e)+n0(e)2), where nu(e) and nv(e) are, respectively, the number of vertices of G lying closer to vertex u than to vertex v and the number of vertices of G lying closer to vertex v than to vertex u, and n0(e) is the number of vertices equidistant to u and v. A cactus is a graph in which any two cycles have at most one common vertex. Let C(n,k) denote the class of all cacti with n vertices and k cycles. In this paper, sharp lower bound on revised Szeged index of graph G in C(n,k) is established and the corresponding extremal graph is determined. Furthermore, the graph G in C(n,k) with the second minimal revised Szeged index is identified as well.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 233, 31 December 2017, Pages 231-239
Journal: Discrete Applied Mathematics - Volume 233, 31 December 2017, Pages 231-239
نویسندگان
Shujing Wang,