





















Let $ G $ be a simple graph with the vertex cover number $ τ$. The energy $ \mathcal{E}(G) $ of $ G $ is the sum of the absolute values of all the adjacency eigenvalues of $ G $. In this article, we establish $ \mathcal{E}(G)\geq 2τ$ for several classes of graphs. The result significantly improves the known result $ \mathcal{E}(G)\geq 2τ-2c$ for many classes of graphs, where $ c $ is the number of odd cycles.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。