Some upper bounds for the energy of graphs
Some upper bounds for the energy of graphs
复制标题
DOI：
10.1007/s10910-006-9183-9
复制
发表时间：
2007-01
影响因子：
1.7
通讯作者：
Huiqing Liu;Mei Lu;F. Tian
中科院分区：
文献类型：
--
作者：
Huiqing Liu;Mei Lu;F. Tian
LetG= (V,E) be a graph withnvertices andeedges. DenoteV(G) = {v1,v2,...,vn}. The 2-degree ofvi, denoted byti, is the sum of degrees of the vertices adjacent to. Let σibe the sum of the 2-degree of vertices adjacent tovi. In this paper, we present two sharp upper bounds for the energy ofGin terms ofn,e,ti, and σi, from which we can get some known results. Also we give a sharp bound for the energy of a forest, from which we can improve some known results for trees.
