Abstract
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 language | English |
|---|---|
| Pages (from-to) | 159-165 |
| Number of pages | 7 |
| Journal | Applied Mathematics |
| Volume | 38 |
| Issue number | 2 |
| Early online date | 23 Jun 2023 |
| DOIs | |
| Publication status | Published - Jun 2023 |
Keywords
- 05C50
- 05C80
- eigenvalue
- Estrada index
- Markov process
- temporary graph
Fingerprint
Dive into the research topics of 'Estrada index of dynamic random graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver