The planar Tur\'{ a}n number of a graph $H$, denoted by $ex_{ \mathcal{ P}}(n,H)$, is the maximum number of edges in an $n$-vertex $H$-free planar graph. Recently, D. Ghosh, et al. initiated the topic of double stars and prove that $ex_{ \mathcal{ P}}(n,S_{ 2,5})\leq \frac{ 20}{ 7}n$. In this paper, we continue to study this and give a sharp upper bound $ex_{ \mathcal{ P}}(n,S_{ 2,5})\leq \frac{ 19}{ 7}n-\frac{ 18}{ 7}$ for all $n\geq 1$, with equality when $n=12$. This improves Ghosh's result.
Categories: math.CO