On an upper bound of the spectral radius of graphs Original Research Article

We give some upper bounds for the spectral radius of bipartite graph and graph, which improve the result in Hong’s Paper [Y. Hong, J.-L. Shu, K. Fang, A sharp upper bound of the spectral radius of graphs, J. Combin. Theory Ser. B 81 (2001) 177–183].