Upper bounds of the energy of triangle-free graphs in terms of matching number

被引：8

作者：

Tian, Fenglei ^{[1
]}

Wong, Dein ^{[2
]}

机构：

[1] Qufu Normal Univ, Inst Operat Res, Sch Management, Rizhao, Peoples R China

[2] China Univ Min & Technol, Sch Math, Xuzhou, Jiangsu, Peoples R China

来源：

LINEAR & MULTILINEAR ALGEBRA | 2019年 / 67卷 / 01期

基金：

中国国家自然科学基金;

关键词：

Graph energy; matching number; rank; CHROMATIC NUMBER; TREES;

D O I：

10.1080/03081087.2017.1408556

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let E(G) be the energy of a graph G, which is defined as the sum of the absolute values of all eigenvalues of G. If G contains no cycle , then it is called a triangle-free graph. In this paper, we investigate the upper bounds of the energy for triangle-free graphs in terms of their matching number and characterize all the extremal graphs attaining the upper bounds. In addition, we establish a relation between graph energy and rank.

引用

页码：20 / 28

页数：9