图的预解Estrada指标的界的估计（英文）

n阶图G的子图中心度,即后来著名的Estrada指标定义为EE（G）=∑_（i=1）~N e~（λ2）.其中λ_1,λ_2……λ_n为图G的特征值.作为复杂网络的一种中心性测度和一种分子结构描述符,Estrada指标在许多研究领域有着广泛的应用.最近,Estrada和High-ama引进了一种新的复杂网络中心度,即∑_（i=1）~n n-1n-1λ_i：他们称之为预解中心度,后来又被称为预解Estrada指标.本文主要利用图G的顶点数和边数给出了图G的预解Estrada指标的若干界.

Bounding the Resolvent Estrada Index of a Graph

The subgraph centrality or later, known as the Estrada index of a graph G of order n, is defined as EE（G）=∑_（i=1）~N e~（λ2）.whereλ_1,λ_2……λ_nare the eigenvalues of G. This index,applications in various fields. Recently, a new concept of centrality of complex networks, introducedby Estrada and Higham, is defined as ∑（i=1）n n-1n-1λ_i：
and called resolvent centrality or later, referredto as resolvent Estrm2a index. In this paper, several bounds for this new index in terms of the numbers of vertices and edges of a graph are presented.