Lower bounds for the energy of graphs
Let be a finite simple undirected graph with vertices and edges. The energy of a graph , denoted by , is defined as the sum of the absolute values of the eigenvalues of . In this paper we present lower bounds for in terms of number of vertices, edges, Randić index, minimum degree, diameter, walk and...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2018-04-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.10.007 |