Estrada index of random bipartite graphs

From MaRDI portal
Publication:2406263





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.











This page was built for publication: Estrada index of random bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2406263)