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.
Recommendations
- On the Estrada index of bipartite graph
- New upper bounds for estrada index of bipartite graphs
- Further results on distance estrada index of random graphs
- On maximum Estrada indices of bipartite graphs with some given parameters
- Estrada and \(\mathcal L\)-Estrada indices of edge-independent random graphs
Cited in
(12)- Further results on distance estrada index of random graphs
- The many facets of the Estrada indices of graphs and networks
- Lower bounds for Gaussian Estrada index of graphs
- Statistically and relatively modular deferred-weighted summability and Korovkin-type approximation theorems
- Estrada and \(\mathcal L\)-Estrada indices of edge-independent random graphs
- Distance Estrada index of random graphs
- The Laplacian energy and Laplacian Estrada index of random multipartite graphs
- On the Estrada index of bipartite graph
- On maximum Estrada indices of bipartite graphs with some given parameters
- A note on the normalized Laplacian estrada index of bipartite graphs
- New upper bounds for estrada index of bipartite graphs
- Estrada index of dynamic random 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)