Abstract
The total eccentricity index of a connected graph is defined as sum of the eccentricities of all its vertices. In this paper, we give the sharp upper bound on the total eccentricity index over graphs with fixed number of pendant vertices and the sharp lower bound on the same over graphs with fixed number of cut vertices. We also provide the sharp upper bounds on the total eccentricity index over graphs with s cut vertices for \(s=0, 1, n-3, n-2\) and propose a conjecture for \(2\le s\le n-4\).
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 callDisclaimer: 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.
