Bounds of graph energy in terms of vertex cover number
详细信息    查看全文
文摘
The energy E(G)E(G) of a graph G is the sum of the absolute values of all eigenvalues of G. In this paper, we give a lower bound and an upper bound for graph energy in terms of vertex cover number. For a graph G with vertex cover number τ  , it is proved that 2τ−2c≤E(G)≤2τΔ, where c is the number of odd cycles in G and Δ is the maximum vertex degree of G. The lower bound is attained if and only if G is the disjoint union of some complete bipartite graphs with perfect matchings and some isolated vertices, the upper bound is attained if and only if G is the disjoint union of τ   copies of K1,ΔK1,Δ together with some isolated vertices.
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.