| تعداد نشریات | 24 |
| تعداد شمارهها | 851 |
| تعداد مقالات | 7,575 |
| تعداد مشاهده مقاله | 13,413,777 |
| تعداد دریافت فایل اصل مقاله | 11,580,469 |
On the first extended zeroth-order connectivity index of trees | ||
| Iranian Journal of Science | ||
| مقاله 3، دوره 38، شماره 3، آبان 2014، صفحه 213-219 اصل مقاله (127.03 K) | ||
| نوع مقاله: Regular Paper | ||
| شناسه دیجیتال (DOI): 10.22099/ijsts.2014.2263 | ||
| نویسندگان | ||
| B. Zhou* 1؛ S. Wang2 | ||
| 12Department of Mathematics, South China Normal University, Guangzhou 510631, P. R. China | ||
| 2Department of Mathematics, Louisiana State University, Baton Rouge, LA 70803-4918, USA | ||
| چکیده | ||
| The first extended zeroth-order connectivity index of a graph G is defined as 0 1/2 1 ( ) ( ) , v v V G G D where V (G) is the vertex set of G, and v D is the sum of degrees of neighbors of vertex v in G. We give a sharp lower bound for the first extended zeroth-order connectivity index of trees with given numbers of vertices and pendant vertices, and characterize the extremal trees. We also determine the n-vertex trees with the first three smallest first extended zeroth-order connectivity indices. | ||
| کلیدواژهها | ||
| Zeroth-order connectivity index؛ extended zeroth-order connectivity index؛ trees, pendant vertices؛ degree of vertices | ||
|
آمار تعداد مشاهده مقاله: 1,336 تعداد دریافت فایل اصل مقاله: 1,051 |
||