On the Steiner $k$-diameter and Steiner ($k,k^{\prime}$)-radius of trees
Qingnan Zhang, Yingzhi Tian

TL;DR
This paper generalizes a known inequality relating Steiner diameters and radii in trees, providing tighter bounds and extending the results to Steiner $(k,k')$-radius for various parameters.
Contribution
It extends the inequality between Steiner $k$-diameter and Steiner $k$-radius to Steiner $(k,k')$-radius in trees, including tight bounds for specific cases.
Findings
Generalized the inequality to Steiner $(k,k')$-radius for all trees.
Established tight bounds for Steiner $k$-diameter when $k'=2$ and $k'=3$.
Extended prior results from 1989 to broader parameters.
Abstract
Given a connected graph and a -set , the of is defined as the size of a minimum tree including in . The - of a vertex in is the maximum value of over all with and . The minimum Steiner -eccentricity over all vertices, denoted by , is called the - of and the maximum Steiner -eccentricity over all vertices, denoted by , is its -. The - of a -subset of , which is an extension of the Steiner -eccentricity of a vertex , is defined as the maximum Steiner distance over all -subsets of containing . The minimum Steiner -eccentricity among all -subsets…
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
TopicsGraph theory and applications · Graph Labeling and Dimension Problems · Interconnection Networks and Systems
