Abstract: The eccentricity of a vertex, , was one of the first, distance-based, tree invariants studied. The total eccentricity of a tree, , is the sum of eccentricities of its vertices. We determine extremal values and characterize extremal tree structures for the ratios , , , and where are leaves of and is in the center of . In addition, we determine the tree structures that minimize and maximize total eccentricity among trees with a given degree sequence.
Recommendations
- Extremal values on the eccentric distance sum of trees
- Total eccentricity index of trees with fixed pendent vertices and trees with fixed diameter
- On the eccentric subtree number in trees
- On the extremal values of the eccentric distance sum of trees
- On the extremal values of the eccentric distance sum of trees
Cites work
- scientific article; zbMATH DE number 5627542 (Why is no real title available?)
- scientific article; zbMATH DE number 2114503 (Why is no real title available?)
- Extremal values for ratios of distances in trees
- Extremal values of ratios: distance problems vs. subtree problems in trees
- Extremal values of ratios: distance problems vs. subtree problems in trees. II
- Greedy trees, caterpillars, and Wiener-type graph invariants
- Greedy trees, subtrees and antichains
- The Wiener maximum quadratic assignment problem
- The distances between internal vertices and leaves of a tree
- The extremal values of the Wiener index of a tree with given degree sequence
- The minimal number of subtrees of a tree
- The minimal number of subtrees with a given degree sequence
- The number of subtrees of trees with given degree sequence
- Upper bounds on the average eccentricity
- Variations of distance-based invariants of trees
Cited in
(26)- Total eccentricity index of trees with fixed pendent vertices and trees with fixed diameter
- On the eccentric subtree number in trees
- Average eccentricity, \(k\)-packing and \(k\)-domination in graphs
- ECCENTRIC DISTANCE SUM OF SUBSTITUTION TREE NETWORKS
- Some extremal problems on the distance involving peripheral vertices of trees with given matching number
- The normality and sum of normalities of trees
- Variations of the eccentricity and their properties in trees
- A note on extremal trees with degree conditions
- Average eccentricity, minimum degree and maximum degree in graphs
- Total eccentricity index of graphs with fixed number of pendant or cut vertices
- Simplified constructions of almost peripheral graphs and improved embeddings into them
- Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs
- On two eccentricity-based topological indices of graphs
- On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs
- Eccentricity of networks with structural constraints
- scientific article; zbMATH DE number 7415568 (Why is no real title available?)
- Unimodal eccentricity in trees
- Extremal graphs with respect to the total-eccentricity index
- The average eccentricity of a graph with prescribed girth
- An alternative proof of the Sombor index minimizing property of greedy trees
- scientific article; zbMATH DE number 10563 (Why is no real title available?)
- Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree
- scientific article; zbMATH DE number 1043912 (Why is no real title available?)
- Wiener index, number of subtrees, and tree eccentric sequence
- Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity
- The average Steiner 3-eccentricity of block graphs
This page was built for publication: Eccentricity sums in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290112)