Degree distance and Gutman index of increasing trees

Degree distance and Gutman index of increasing trees

‎‎The Gutman index and degree distance of a connected graph G G are defined as‎ ‎‎‎Gut(G)=∑ {u,v}⊆V(G) d(u)d(v)d G (u,v)‎,‎ ‎‎Gut(G)=∑{u,v}⊆V(G)d(u)d(v)dG(u,v)‎,‎‎ ‎and‎ ‎‎‎DD(G)=∑ {u,v}⊆V(G) (d(u)+d(v))d G (u,v)‎,‎ ‎‎DD(G)=∑{u,v}⊆V(G)(d(u)+d(v))dG(u,v)‎,‎‎ ‎respectively‎, ‎where‎ ‎d(u) d(...

Full description

Bibliographic Details
Main Authors: Ramin Kazemi, Leila Meimondari
Format: Article
Language:English
Published: University of Isfahan 2016-06-01
Series:Transactions on Combinatorics
Subjects:
‎‎Increasing trees‎
the Wiener index‎
‎the Gutman index‎
‎degree distance
Online Access:http://www.combinatorics.ir/article_9915_00377372a764b119bb3640a24a194a64.pdf

Internet

http://www.combinatorics.ir/article_9915_00377372a764b119bb3640a24a194a64.pdf

Similar Items