We need to use the following
bounds on spectral radius.
The first bound was found by
Hong, Shu and Fang [1]}
for connected graphs.
Independently, Nikiforov [2]} published
a quite different method of this result for all graphs
(not necessarily connected).
Moreover, Zhou and Cho [3]}
determined the graphs which attain this upper bound.
