Degree distance and Gutman index of increasing trees
عنوان مقاله: Degree distance and Gutman index of increasing trees
شناسه ملی مقاله: JR_COMB-5-2_003
منتشر شده در در سال 1395
شناسه ملی مقاله: JR_COMB-5-2_003
منتشر شده در در سال 1395
مشخصات نویسندگان مقاله:
Ramin Kazemi - Department of statistics, Imam Khomeini International University, Qazvin
Leila Meimondari - Imam Khomeini International University
خلاصه مقاله:
Ramin Kazemi - Department of statistics, Imam Khomeini International University, Qazvin
Leila Meimondari - Imam Khomeini International University
The Gutman index and degree distance of a connected graph G are defined as \begin{eqnarray*} \textrm{Gut}(G)=\sum_{\{u,v\}\subseteq V(G)}d(u)d(v)d_G(u,v), \end{eqnarray*} and \begin{eqnarray*} DD(G)=\sum_{\{u,v\}\subseteq V(G)}(d(u)+d(v))d_G(u,v), \end{eqnarray*} respectively, where d(u) is the degree of vertex u and d_G(u,v) is the distance between vertices u and v. In this paper, through a recurrence equation for the Wiener index, we study the first two moments of the Gutman index and degree distance of increasing trees.
کلمات کلیدی: Increasing trees, the Wiener index, the Gutman index, degree distance
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1319372/