Abstract
The energy of a graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of G. In this paper we present some new upper bounds for E(G) in terms of number of vertices, number of edges, clique number, minimum degree, and the first Zagreb index.
| Original language | English |
|---|---|
| Pages (from-to) | 657-662 |
| Number of pages | 6 |
| Journal | Match |
| Volume | 70 |
| Issue number | 2 |
| State | Published - 2013 |