Total eccentricity index of graphs with fixed number of pendant or cut vertices

arXiv2012.01090MaRDI QIDQ6355121FDOQ6355121

Publication date: 2 December 2020

Abstract: The total eccentricity index of a connected graph is defined as sum of the eccentricities of all its vertices. We denote the set of all connected graphs on

n

vertices with

k

pendant vertices by

m a t h f r a k H_{n, k}

and denote the set of all connected graphs on

n

vertices with

s

cut vertices by

m a t h f r a k C_{n, s}

. In this paper, we give the sharp lower and upper bounds on the total eccentricity index over

m a t h f r a k H_{n, k}

and the sharp lower bound for the same over

m a t h f r a k C_{n, s}

. We also provide the sharp upper bounds on the total eccentricity index over

m a t h f r a k C_{n, s}

when

s = 0, 1, n - 3, n - 2

and propose a problem regarding the upper bound over

m a t h f r a k C_{n, s}

for

2 l e q s l e q n - 4.

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

This page was built for publication: Total eccentricity index of graphs with fixed number of pendant or cut vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6355121)