engleski

Trees with maximal second Zagreb index and prescribed number of vertices of the given degree

In this paper we present a simple algorithm for calculating the maximal value of the second Zagreb index for trees with prescribed number of vertices of given degree. The user needs only to input values n 1, n 2, ..., n δ where ni is the number of vertices of degree i. The algorithm outputs the edge connectivity values m ij as well as the maximal value of the second Zagreb index. The complexity of the algorithm is proportional to Δ 3, where Δ is maximal degree. Since complexity is independent of the number of vertices, for chemical ....

Zagreb index ; degree sequence ; extremal graph ; molecular descriptor

nije evidentirano