Let G = (V,E) be a graph of order n and size m. The energy of a graph is defined as E(G) = ΣnI=1 |λi|, where λ1 ≥ λ2 ≥ · · · ≥ λn are eigenvalues of the adjacency matrix of G. Some new upper bounds on E(G) are obtained.