Journal of East China Normal University(Natural Sc ›› 2016, Vol. 2016 ›› Issue (1): 96-101.doi: 10.3969/j.issn.1000-5641.2016.01.012

• Article • Previous Articles     Next Articles

Characterization of bipartite graph with maximum spectral radius

 NIU  Ai-Hong[1] , WANG  Guo-Ping[1] , QIN  Zheng-Xin[2] , MOU  Shan-Zhi[3]   

  • Received:2015-01-23 Online:2016-01-25 Published:2016-03-10

Abstract: 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.

Key words: bipartite graph, cycle;spectral radius

CLC Number: