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(...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
University of Isfahan
2016-06-01
|
| Colección: | Transactions on Combinatorics |
| Materias: | |
| Acceso en línea: | http://www.combinatorics.ir/article_9915_00377372a764b119bb3640a24a194a64.pdf |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|