Some sharp bounds on the average Steiner (k, l)-eccentricity for trees
Abstract
In this paper we introduce some transformations for trees that do not increase the average Steiner (k,l)-eccentricity for all 0≤ l≤ k≤ n. Using these transformations, we obtain some sharp bounds on the average Steiner (k,l)-eccentricity for trees with some certain conditions, including given nodes, given diameter, given max degree and given leaves, and get the corresponding extremal trees as well.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.