Answers are grounded in this paper and cite their sources.
Let \(G\) be a simple graph of order \(n\) with eigenvalues \(λ_1,λ_2,⋯,λ_n\) and normalized Laplacian eigenvalues \(μ_1,μ_2,⋯,μ_n\). The Estrada index and normalized Laplacian Estrada index are defined as \(EE(G)=∑ₖ₌₁^neλ_k\) and \(LEE(G)=∑ₖ₌₁^neμ_k-1\), respectively. We establish upper and lower bounds to \(EE\) and \(LEE\) for edge-independent random graphs, containing the classical Erdös-Rényi graphs as special cases.
No takes yet. Share an insight, caveat, or question.
Yilun Shang (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: