Abstract: A tree is said to be starlike if exactly one of
its vertices has degree larger than 2.  A
 m-starlike tree is obtained by appending a starlike tree to every
one  terminus of  a starlike tree $S_{0}=S(m_{01}, m_{02}, ...
,m_{0\Delta_{0}})$. Gutman and L. Shi give a
 bound of the spectral radii  of starlike tree. In this
paper, we give an another  short proof and further discussions about
this result. Sometime, we give a new upper bound of the spectral
radii of m-starlike tree.

Key words:  m-Starlike tree,  , Spectra of graphs, Spectral radius