Paper Info
Title
Extremal trees of given segment sequence with respect to some eccentricity-based invariants
Abstract
A path P is a segment of a tree if the endpoints of P are of degree 1 or at least 3, and each of the rest vertices are of degree 2 in the tree. The lengths of all the segments of this tree form its segment sequence. Denote by Tl the set of all trees on n vertices with the segment sequence l=(l1,l2,…,lm), where l1⩾l2⩾⋯⩾lm. In this paper, the extremal structures of trees among Tl, which minimize or maximize the first (resp. second) Zagreb eccentricity index, the eccentric connectivity index, and the eccentric distance sum, are characterized. Furthermore, we consider similar extremal problems for trees with fixed number of segments.
Year
DOI
Venue
2020
10.1016/j.dam.2020.03.018
Discrete Applied Mathematics
Keywords
DocType
Volume
Segment sequence,Zagreb eccentricity index,Eccentricity-based invariant
Journal
284
ISSN
Citations 
PageRank 
0166-218X
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Minjie Zhang125530.01
Chengyong Wang210.70
Shuchao Li332.44