New upper bounds for the energy of graphs

CSpace

	New upper bounds for the energy of graphs
	Yu, AM ; Lu, M ; Tian, F
	2005
发表期刊	MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY
ISSN	0340-6253
卷号	53 期号:2 页码:441-448
摘要	Let G be a finite simple undirected graph with n vertices and m edges. For nu is an element of V, the 2-degree of nu is the sum of the degrees of the vertices adjacent to nu. The energy of G, denoted by E(G), is defined as the sum of the absolute values of the eigenvalues of G. In this paper, we present two new upper bounds for E(G) in terms of n, m, the degrees and 2-degrees of vertices, and characterize the graphs for which the bounds are best possible.
语种	英语
WOS研究方向	Chemistry ; Computer Science ; Mathematics
WOS类目	Chemistry, Multidisciplinary ; Computer Science, Interdisciplinary Applications ; Mathematics, Interdisciplinary Applications
WOS记录号	WOS:000229206700016
出版者	UNIV KRAGUJEVAC, FAC SCIENCE
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/1803
专题	中国科学院数学与系统科学研究院
通讯作者	Yu, AM
作者单位	1.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China 2.Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China 3.Tsinghua Univ, Dept Math Sci, Beijing 100084, Peoples R China
推荐引用方式 GB/T 7714	Yu, AM,Lu, M,Tian, F. New upper bounds for the energy of graphs[J]. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY,2005,53(2):441-448.
APA	Yu, AM,Lu, M,&Tian, F.(2005).New upper bounds for the energy of graphs.MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY,53(2),441-448.
MLA	Yu, AM,et al."New upper bounds for the energy of graphs".MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY 53.2(2005):441-448.