A note on new bounds for the Estrada Index

Let G be a graph on n vertices and λ1,λ2,…,λn their eigenvalues. The Estrada index of G is defined as EE(G)=∑i=1neλi. In this paper, we obtain new upper and lower bounds on the Estrada Index of a given graph, considering numerical inequalities present in the literature.

Bibliographische Detailangaben

Veröffentlicht in:	Linear algebra and its applications 2019-11, Vol.580, p.121-127
1. Verfasser:	Rodríguez, Jonnathan
Format:	Artikel
Sprache:	eng
Schlagworte:	Adjacency matrix Apexes Eigenvalues Estrada Index Graph theory Inequalities Linear algebra Lower bound Lower bounds Upper bound
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!