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

Abstract: Given a connected graph $G=(V,E)$ and a $k$-set $S\subseteq V(G)$, the $Steiner$ $distance$ $d_{G}(S)$ of $S$ is defined as the size of a minimum tree including $S$ in $G$. The $Steiner$ $k$-$eccentricity$ of a vertex $v$ in $G$ is the maximum value of $d_G(S)$ over all $S\subseteq V(G)$ with $|S|=k$ and $v\in S$. The minimum Steiner $k$-eccentricity over all vertices, denoted by $Sr_k(G)$, is called the $Steiner$ $k$-$radius$ of $G$ and the maximum Steiner $k$-eccentricity over all vertices, denoted by $Sd_k(G)$, is its $Steiner$ $k$-$diameter$. The $Steiner$ $(k,k<sup>{\prime})$-$eccentricity$ of a $k<sup>{\prime}$-subset $S<sup>{\prime}$ of $V(G)$, which is an extension of the Steiner $k$-eccentricity of a vertex $v$, is defined as the maximum Steiner distance over all $k$-subsets of $V(G)$ containing $S<sup>{\prime}$. The minimum Steiner $(k,k<sup>{\prime})$-eccentricity among all $k<sup>{\prime}$-subsets of $V(G)$, denoted by $Sr_{k,k<sup>{\prime}}(G)$, is called the $Steiner$ $(k,k<sup>{\prime})$-$radius$ of $G$. In 1989, Chartrand, Oellermann, Tian and Zou showed that for any $k\geq3$, $Sd_k(T)\leq \frac{k}{k-1}Sr_k(T)$ for any tree $T$. In this paper, we generalize this result and show that $$Sd_k(T)\leq \frac{k}{k-k<sup>{\prime}}Sr_{k,k<sup>{\prime}}(T)$$ for any $k\geq3$, $k&gt;k<sup>{\prime}\geq1$. Furthermore, for $k<sup>{\prime}=2$ and $k<sup>{\prime}=3$, we obtain a tight upper bound of the Steiner $k$-diameter by the Steiner $(k,k<sup>{\prime})$-radius for all trees.