Let G be a graph of size n, and let ƛ1 ƛ2; ƛ3, be its eigenvalues. The Estrada index of G is defined as EE(G) = Σn i=1 ƛi . In this paper, we establish almost sure results on EE(G(n; p)) of Erdös-Rényi random graph G(n; p) in the uperconnectivity regime. [ABSTRACT FROM AUTHOR]
Published
2011
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.