Lower bounds for the energy of graphs
Let G be a finite simple undirected graph with n vertices and m edges. The energy of a graph G , denoted by E ( G ) , is defined as the sum of the absolute values of the eigenvalues of G . In this paper we present lower bounds for E ( G ) in terms of number of vertices, edges, Randić index, minimum...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2018-04-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860016302031 |