%A NIU Ai-Hong, WANG Guo-Ping, QIN Zheng-Xin, MOU Shan-Zhi
%T Characterization of bipartite graph with maximum spectral radius
%0 Journal Article
%D 2016
%J Journal of East China Normal University(Natural Science)
%R 10.3969/j.issn.1000-5641.2016.01.012
%P 96-101
%V 2016
%N 1
%U {https://xblk.ecnu.edu.cn/CN/abstract/article_25269.shtml}
%8 2016-01-25
%X The adjacency matrix A(G) of a graph G is the n\times

n matrix with its (i,j)-entry equal to 1 if v_i and v_j are

adjacent, and 0 otherwise. The spectral radius of G is the

largest eigenvalue of A(G). In this paper we determine the graphs

with maximum spectral radius among all trees, and all bipartite

unicyclic, bicyclic, tricyclic, tetracyclic, pentacyclic and

quasi-tree graphs, respectively.