文献类型：期刊文献

英文题名：Ordering of Connected Bipartite Unicyclic Graphs with Large Energies

作者：Guo, Ji-Ming[1];Qian, Hua[1];Shan, Hai-Ying[2];Wang, Zhi-Wen[1]

机构：[1]East China Univ Sci & Technol, Dept Math, Shanghai, Peoples R China;[2]Tongji Univ, Sch Math Sci, Shanghai, Peoples R China

年份：2019

卷号：82

期号：2

起止页码：443

外文期刊名：MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY

收录：;WOS:【SCI-EXPANDED(收录号:WOS:000491305000006)】；

基金：This research is supported by NSFC (No. 11371372); supported by the Fundamental Research Funds for the Central Universities (No. 22120180254).

语种：英文

摘要：The energy of a graph is the sum of the absolute value of the eigenvalues of its adjacency matrix. In this paper, the first left perpendicular n-5/2 right perpendicular largest energies of connected bipartite unicyclic graphs on n >= 78 vertices are determined which generalize some known results.