Upper Bounds of Graph Energy in Terms of Matching Number

被引:0
|
作者
Pan, Yingui [1 ]
Chen, Jing [2 ]
Li, Jianping [1 ]
机构
[1] Natl Univ Def Technol, Coll Liberal Arts & Sci, Changsha 410073, Hunan, Peoples R China
[2] Hunan First Normal Univ, Sch Math & Computat Sci, Changsha 410073, Hunan, Peoples R China
基金
中国国家自然科学基金;
关键词
D O I
暂无
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
The energy of a graph G, denoted by epsilon(G), is the sum of the absolute values of all the eigenvalues of its adjacency matrix A(G). In this paper, we give the upper bounds of graph energy in terms of matching number and characterize all the extremal graphs achieving the upper bounds.
引用
收藏
页码:541 / 554
页数:14
相关论文
共 50 条