کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6420069 | 1631781 | 2016 | 5 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Comparison between the zeroth-order RandiÄ index and the sum-connectivity index
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Comparison between the zeroth-order RandiÄ index and the sum-connectivity index Comparison between the zeroth-order RandiÄ index and the sum-connectivity index](/preview/png/6420069.png)
چکیده انگلیسی
The zeroth-order RandiÄ index and the sum-connectivity index are very popular topological indices in mathematical chemistry. These two indices are based on vertex degrees of graphs and attracted a lot of attention in recent years. Recently Li and Li (2015) studied these two indices for trees of order n. In this paper we obtain a relation between the zeroth-order RandiÄ index and the sum-connectivity index for graphs. From this we infer an upper bound for the sum-connectivity index of graphs. Moreover, we prove that the zeroth-order RandiÄ index is greater than the sum-connectivity index for trees. Finally, we show that R2,âα(G) is greater or equal R1,âα(G) (α ⥠1) for any graph and characterize the extremal graphs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 274, 1 February 2016, Pages 585-589
Journal: Applied Mathematics and Computation - Volume 274, 1 February 2016, Pages 585-589
نویسندگان
Kinkar Ch. Das, Matthias Dehmer,