Abstract
We use Hadamard's determinantal inequality and its generalization to prove some upper bounds on the energy of a graph in terms of degrees, average 2-degrees and number of common neighbors of its vertices. Also, we prove an inequality relating the energy of a graph and one arbitrary subgraph of it.
