|
|
|
|
leap zagreb indices of trees and unicyclic graphs
|
|
|
|
|
|
|
|
نویسنده
|
shao zehui ,gutman ivan ,li zepeng ,wang shaohui ,wu pu
|
|
منبع
|
communications in combinatorics and optimization - 2018 - دوره : 3 - شماره : 2 - صفحه:179 -194
|
|
چکیده
|
In this paper, we only consider graphs without multiple edges or loops. the degree ofa vertex v in a considered graph is denoted by d(v). a double star sr,s is a tree with exactly two vertices u and v that are not leaves, such that (d(u), d(v)) = (r + 1, s + 1).
|
|
کلیدواژه
|
leap zagreb index ,zagreb index ,degree (of vertex)
|
|
آدرس
|
guangzhou university, institute of computing science and technology, china, university of kragujevac, faculty of science, serbia, lanzhou university, school of information science and engineering, china, savannah state university, department of mathematics, usa, guangzhou university, institute of computing science and technology, china
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|