Lower bounds for the energy of graphs

Lower bounds for the energy of graphs

Show other versions (1)

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...

Full description

Bibliographic Details
Main Author: Akbar Jahanbani
Format: Article
Language:English
Published: Taylor & Francis Group 2018-04-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
energy (of non-singular graph)
determinant of adjacency matrix
randić index
spectral radius
Online Access:http://dx.doi.org/10.1016/j.akcej.2017.10.007
Description
Summary: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 determinant of the adjacency matrix. Also we show our lower bound in (11) under certain conditions is better than the classical bounds given in Caporossi et al. (1999), Das (2013) and McClelland (1971).
ISSN:0972-8600

Similar Items