Extremal trees of given degree sequence or segment sequence with respect to Steiner 3-eccentricity
Xin Liu

TL;DR
This paper determines extremal trees with given degree or segment sequences that maximize Steiner 3-eccentricity, providing sharp bounds and characterizations for various classes of trees.
Contribution
It establishes the maximum average Steiner 3-eccentricity for trees with specified degree and segment sequences and characterizes the extremal trees achieving these bounds.
Findings
Identified the sharp upper bounds on average Steiner 3-eccentricity for trees with given degree sequences.
Characterized the unique extremal trees with maximum Steiner 3-eccentricity among various classes.
Provided explicit structures of extremal trees based on degree and segment constraints.
Abstract
The Steiner -eccentricity of a vertex in graph is the maximum Steiner distance over all -subsets containing the vertex. %Some general properties of the Steiner 3-eccentricity of trees are given. Let be the set of all -vertex trees, be the set of -vertex trees with given maximum degree equal to , be the set of -vertex trees with exactly vertices of maximum degree, and let be the set of -vertex trees with exactly vertices of given maximum degree equal to In this paper, we first determine the sharp upper bound on the average Steiner 3-eccentricity of -vertex trees with given degree sequence. The corresponding extremal graph is characterized. Consequently, together with majorization theory, the unique graph among (resp. ,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · VLSI and FPGA Design Techniques · Advanced Graph Theory Research
