The energy of a graph began with German physicist, Erich H¨uckel’s 1931 paper, Quantenttheoretische Beitr¨age zum Benzolproblem. His work developed a method for computing the binding energy of the π-electrons for a certain class of organic molecules. The vertices of the graph represented the carbon atoms while the single edge between each pair of distinct vertices represented the hydrogen bonds between the carbon atoms. In turn, the chemical graphs were represented by an n × n matrix used in solving Schr¨odinger’s eigenvalue/eigenvector equation. The sum of the absolute values of these graph eigenvalues represented the total π-electron energy. The criteria for constructing these chemical graphs and the chemical interpretations of all the quantities involved made up the H¨uckel Molecular Orbital theory or HMO theory. In this paper, we will show how the chemical interpretation of H¨uckel’s graph energy evolved to a mathematical interpretation of graph energy that Ivan Gutman provided for us in his famous 1978 definition of the energy of a graph. Next, we will present Charles Coulson’s 1940 theorem that expresses the energy of a graph as a contour integral and prove some of its corollaries. These corollaries allow us to order the energies of acyclic and bipartite graphs by the coefficients of their characteristic polynomial. Following Coulson’s theorem and its corollaries we will look at McClelland’s first theorem on the bounds for the energy of a graph. In the corollaries that follow McClelland’s 1971 theorem, we will prove the corollaries that show a direct variation between the energy of a graph and the number of its vertices and edges. Finally, we will see how this relationship led to Gutman’s conjecture that the complete graph on n vertices has maximal energy. Although this was disproved by Chris Godsil in 1981, we will provide an independent counterexample with the help of the software, Maple 13