Abstract
The eccentricity index of a graph is the sum of the eccentricities of all vertices in the graph. A segment S of a tree T is a subgraph isomorphic to a non-trivial path where all internal vertices have degree 2 in T and the end-vertices are branching vertices or leaves. The segment sequence of a tree is the sequence of the lengths of all segments in a tree. In this paper, we characterise trees of a given segment sequence with minimum eccentricity index. We show that in the family of trees of a given segment sequence, the tree with minimum eccentricity index is the unique ‘starlike’ tree (a tree with one branching vertex).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
