A Short Proof for Graph Energy is at Least Twice of Minimum Degree

被引：0

作者：

Akbari, Saieed ^{[1
]}

Hosseinzadeh, Mohammad Ali ^{[2
]}

机构：

[1] Sharif Univ Technol, Dept Math Sci, Tehran, Iran

[2] Amol Univ Special Modern Technol, Fac Engn Modern Technol, Amol 4616849767, Iran

来源：

MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY | 2020年 / 83卷 / 03期

基金：

美国国家科学基金会;

关键词：

D O I：

暂无

中图分类号：

O6 [化学];

学科分类号：

0703 ;

摘要：

The energy epsilon(G) of a graph G is the sum of the absolute values of all eigenvalues of G. Zhou in (MATCH Commun. Math. Comput. Chem. 55 (2006) 91-94) studied the problem of bounding the graph energy in terms of the minimum degree together with other parameters. He proved his result for quadrangle-free graphs. Recently, in (MATCH Commun. Math. Comput. Chem. 81 (2019) 393-404) it is shown that for every graph G, epsilon(G) >= 2 delta(G), where delta(G) is the minimum degree of G, and the equality holds if and only if G is a complete multipartite graph with equal size of parts. Here, we provide a short proof for this result. Also, we give an affirmative answer to a problem proposed in (MATCH Commun. Math. Comput. Chem. 81 (2019) 393-404).

引用

页码：631 / 633

页数：3