Title of article :
Leap Zagreb indices of trees and unicyclic graphs
Author/Authors :
Shao ، Zehui Institute of Computing Science and Technology - Guangzhou University , Gutman ، Ivan Faculty of Science - University of Kragujevac , Li ، Zepeng School of Information Science and Engineering - Lanzhou University , Wang ، Shaohui Department of Mathematics - Savannah State University , Wu ، Pu Institute of Computing Science and Technology - Guangzhou University
Abstract :
In this paper, we only consider graphs without multiple edges or loops. The degree of a 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).
Keywords :
Leap Zagreb index , Zagreb index , degree (of vertex)
Journal title :
Communications in Combinatorics and Optimization
Journal title :
Communications in Combinatorics and Optimization
