Published January 1, 2017 | Version v1
Journal article Open

Lower Bounds for the Energy of (Bipartite) Graphs

  • 1. Selcuk Univ, Fac Sci, Dept Math, TR-42075 Konya, Turkey

Description

The energy of a graph is defined as the sum of absolute values of its eigenvalues. In this paper, we establish some lower bounds for the energy of (bipartite) graphs involving the number of vertices (n), the number edges (m) and the determinant of the adjacency matrix (det A). Our lower bound for graphs improves the lower bound in [2] for a class of graphs.

Files

bib-8050a27f-62d7-412a-9930-f71ec85f2029.txt

Files (162 Bytes)

Name Size Download all
md5:dea9142c282a25a557bb9f8978999df3
162 Bytes Preview Download