کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8941803 | 1645038 | 2018 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On the difference between the (revised) Szeged index and the Wiener index of cacti
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
A connected graph is said to be a cactus if each of its blocks is either a cycle or an edge. Let Cn be the set of all n-vertex cacti with circumference at least 4, and let Cn,k be the set of all n-vertex cacti containing exactly k⩾1 cycles where n⩾3k+1. In this paper, lower bounds on the difference between the (revised) Szeged index and Wiener index of graphs in Cn (resp. Cn,k) are proved. The minimum and the second minimum values on the difference between the Szeged index and Wiener index of graphs among Cn are determined. The bound on the minimum value is strengthened in the bipartite case. A lower bound on the difference between the revised Szeged index and Wiener index of graphs among Cn,k is also established. Along the way the corresponding extremal graphs are identified.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 247, 1 October 2018, Pages 77-89
Journal: Discrete Applied Mathematics - Volume 247, 1 October 2018, Pages 77-89
نویسندگان
Sandi Klavžar, Shuchao Li, Huihui Zhang,