Paper Info
Title
On The Extremal Values For The Mostar Index Of Trees With Given Degree Sequence
Abstract
For a given graph G, the Mostar index Mo(G) is the sum of absolute values of the differences between n(u)(e) and n(v)(e) over all edges e = uv of G, where n(u)(e) and n(v)(e) are, respectively, the number of vertices of G lying closer to u than to v and the number of vertices of G lying closer to v than to u. The degree sequence of a tree is the sequence of the degrees (in descending order) of the non-leaf vertices. This paper determines those trees with a given degree sequence which have the greatest Mostar index. Consequently, all extremal trees with the greatest Mostar index are obtained in the sets of all trees of order n with the maximum degree, the number of leaves, the independence number and the matching number, respectively. On the other hand, some properties of trees with a given degree sequence which have the least Mostar index are given. We also determine those trees with exactly n - 3 or n - 4 leaves when the degree sequence is given, which have the least Mostar index. At last some numerical results are discussed, in which we calculate the Mostar indices of two sets of molecular graphs: octane isomers and benzenoid hydrocarbons; We compare their Mostar indices with some other distance-based topological indices through their correlations with the chemical properties. The linear model for the Mostar index is better than or as good as the models corresponding to the other distance-based indices. (C) 2020 Elsevier Inc. All rights reserved.
Year
DOI
Venue
2021
10.1016/j.amc.2020.125598
APPLIED MATHEMATICS AND COMPUTATION
Keywords
DocType
Volume
Degree sequence, Mostar index, Octane isomer, Benzenoid hydrocarbon
Journal
390
ISSN
Citations 
PageRank 
0096-3003
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Kecai Deng100.68
Shuchao Li218335.15