New bounds for the energy of graphs

Let G be a finite simple undirected graph with n vertices and m edges. The energy of the graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of G. In this talk we present some new bounds for E(G) in terms of n, m and the largest and smallest eigenvalues of G. A number of our results rely on the use of well-known inequalities.

This is joint work with Robert Jajcay and Ivan Gutman.

Join Zoom Meeting HERE!