Estrada index of dynamic random graphs

Yi lun Shang*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


The Estrada index of a graph G on n vertices is defined by EE(G)=∑i=1neλ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ös-Rényi 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.

Original languageEnglish
Pages (from-to)159-165
Number of pages7
JournalApplied Mathematics
Issue number2
Early online date23 Jun 2023
Publication statusPublished - Jun 2023

Cite this