Back to Search
Start Over
The Estrada index of random graphs.
- Source :
-
Scientia Magna . 2011, Vol. 7 Issue 1, p79-81. 3p. - Publication Year :
- 2011
-
Abstract
- 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]
- Subjects :
- *RANDOM graphs
*GRAPHIC methods
*EQUATIONS
*MATHEMATICS
Subjects
Details
- Language :
- English
- ISSN :
- 15566706
- Volume :
- 7
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Scientia Magna
- Publication Type :
- Academic Journal
- Accession number :
- 61442061