Unweighted p-center problem on extended stars

An extended star is a tree which has only one vertex with degree larger than two. The p -center problem in a graph G asks to find a subset X of the vertices of G of cardinality p such that the maximum weighted distances from X to all vertices is minimized. In this paper we consider the p -center problem on the unweighted extended stars, and present some properties to find solution.