Estrada index of random bipartite graphs (Q2406263)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Estrada index of random bipartite graphs
scientific article

    Statements

    Estrada index of random bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    27 September 2017
    0 references
    Summary: The Estrada index of a graph \(G\) of \(n\) vertices is defined by \(EE(G)=\sum_{i=1}^ne^{\lambda_i}\), where \(\lambda_1,\lambda_2,\dots,\lambda_n\) are the eigenvalues of \(G\). In this paper, we give upper and lower bounds of \(EE(G)\) for almost all bipartite graphs by investigating the upper and lower bounds of the spectrum of random matrices. We also formulate an exact estimate of \(EE(G)\) for almost all balanced bipartite graphs.
    0 references
    0 references
    Estrada index
    0 references
    random graph
    0 references
    eigenvalues
    0 references
    limit spectral distribution
    0 references
    0 references