Respected readers, authors and reviewers, you can add comments to this page on any questions about the contribution, review, editing and publication of this journal. We will give you an answer as soon as possible. Thank you for your support!
NIU Ai-Hong, WANG Guo-Ping, QIN Zheng-Xin, MOU Shan-Zhi. Characterization of bipartite graph with maximum spectral radius[J]. Journal of East China Normal University (Natural Sciences), 2016, (1): 96-101. doi: 10.3969/j.issn.1000-5641.2016.01.012
Citation:
NIU Ai-Hong, WANG Guo-Ping, QIN Zheng-Xin, MOU Shan-Zhi. Characterization of bipartite graph with maximum spectral radius[J]. Journal of East China Normal University (Natural Sciences), 2016, (1): 96-101. doi: 10.3969/j.issn.1000-5641.2016.01.012
NIU Ai-Hong, WANG Guo-Ping, QIN Zheng-Xin, MOU Shan-Zhi. Characterization of bipartite graph with maximum spectral radius[J]. Journal of East China Normal University (Natural Sciences), 2016, (1): 96-101. doi: 10.3969/j.issn.1000-5641.2016.01.012
Citation:
NIU Ai-Hong, WANG Guo-Ping, QIN Zheng-Xin, MOU Shan-Zhi. Characterization of bipartite graph with maximum spectral radius[J]. Journal of East China Normal University (Natural Sciences), 2016, (1): 96-101. doi: 10.3969/j.issn.1000-5641.2016.01.012
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.
[1]BERMAN A, ZHANG X D. On the spectral radius of graph with cut vertices [J]. J Combin Theory Ser B, 2001, 83: 233-240.[2] BRUALDI R, SOLHEID E. On the spectral radius of connected graphs[J]. Publ Inst Math (Beograd), 1986, 39 (53): 45-53.[3]HOU Y P, LI J S. Bounds on the largest eigenvalues of trees with a given size of matching [J]. Linear Algebra Appl, 2002, 342: 203-217.