Improved bound of graph energy in terms of vertex cover number
Improved bound of graph energy in terms of vertex cover number
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.
Aniruddha Samanta
数学
Aniruddha Samanta.Improved bound of graph energy in terms of vertex cover number[EB/OL].(2025-07-01)[2025-07-21].https://arxiv.org/abs/2507.00798.点此复制
评论