کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
473288 | 698785 | 2011 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Relationship between the eccentric connectivity index and Zagreb indices
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Relationship between the eccentric connectivity index and Zagreb indices Relationship between the eccentric connectivity index and Zagreb indices](/preview/png/473288.png)
چکیده انگلیسی
For a (molecular) graph, the first Zagreb index M1M1 is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M2M2 is equal to the sum of the products of the degrees of pairs of adjacent vertices. If GG is a connected graph with vertex set V(G)V(G), then the eccentric connectivity index of GG, ξC(G)ξC(G), is defined as, ∑vi∈V(G)diei∑vi∈V(G)diei, where didi is the degree of a vertex vivi and eiei is its eccentricity. In this report we compare the eccentric connectivity index (ξCξC) and the Zagreb indices (M1M1 and M2M2) for chemical trees. Moreover, we compare the eccentric connectivity index (ξCξC) and the first Zagreb index (M1M1) for molecular graphs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Mathematics with Applications - Volume 62, Issue 4, August 2011, Pages 1758–1764
Journal: Computers & Mathematics with Applications - Volume 62, Issue 4, August 2011, Pages 1758–1764
نویسندگان
Kinkar Ch. Das, N. Trinajstić,