期刊论文

Tang, Liangwen;Lin, Mugan;Li, QP

英文

MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY

0340-6253

2023

90

3

709-716

10.46793/match.90-3.709T

Acknowledgment: The authors are grateful to the anonymous referee for valuable comments which helped us to improve the manuscript. This work was supported in part by the National Natural Science Foundation of China (61772179), the Scientific Research Fund of Hunan Provincial Education Department (22A0502), Hunan Provincial Natural Science Foundation of China (2019JJ40005), 14th Five-Year Plan Key Disciplines and Application-oriented Special Disciplines of Hunan Province(Xiangjiaotong [2022] 351), Science and Technology Plan Project of Hunan Province (2016TP1020), Open Fund Project of Hunan Provincial Key Laboratory of Intelligent Information Processing and Application for Hengyang Normal University (2022HSKFJJ012), and Instructiveness Plan Project of Hengyang (Grant No. 202121014362).

本校为第一且通讯机构

The energy ε(G) of a graph G is the sum of the absolute values of all eigenvalues of G. An interesting and “hard-to-crack” problem about graph energy was mentioned by Gutman in [The energy of a graph: old and new results]: characterize the graphs G and their edges e for which ε(G - e) < ε(G). In this paper, we give a new sufficient condition for ε(G-e) < ε(G) where e is not necessarily to be a cut-edge set or a cut edge. This work can be used to generalize some well-known results. © 2023 Universi...