Xing-Fu Li

most citedOn the computational complexity of the Steiner

k

-eccentricity

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

math.CO2021★ 1 cited

On the computational complexity of the Steiner $k$ -eccentricity

Xingfu Li, Guihai Yu, Aleksandar Ilić +1

The Steiner $k$ -eccentricity of a vertex $v$ of a graph $G$ is the maximum Steiner distance over all $k$ -subsets of $V (G)$ which contain $v$ . A linear time algorithm for calculati…

math.CO2020

On the average Steiner 3-eccentricity of trees

Xingfu Li, Guihai Yu, Sandi Klavžar

The Steiner $k$ -eccentricity of a vertex $v$ of a graph $G$ is the maximum Steiner distance over all $k$ -subsets of $V (G)$ which contain $v$ . In this paper Steiner $3$ -eccentricity…

On the computational complexity of the Steiner k-eccentricity

On the average Steiner 3-eccentricity of trees

On the computational complexity of the Steiner $k$ -eccentricity