Estrada Index of Random Bipartite Graphs
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,\cdots,\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 a...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2015-12-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2073-8994/7/4/2195 |