摘要
The Estrada index of a graph G on n vertices is defined by EE(G)=∑^(n)_(i=1)^(eλ_(i)),whereλ_(1),λ_(2),···,λ_(n)are the adjacency eigenvalues of G.We define two general types of dynamic graphs evolving according to continuous-time Markov processes with their stationary distributions matching the Erd¨os-R´enyi random graph and the random graph with given expected degrees,respectively.We formulate some new estimates and upper and lower bounds for the Estrada indices of these dynamic graphs.
基金
Supported by a starting grant of Northumbria University.
