| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4599336 | Linear Algebra and its Applications | 2015 | 13 Pages |
Abstract
The Estrada index of a graph G is defined as EE(G)=âi=1neλi, where λ1, λ2,â¦,λn are the eigenvalues of the adjacency matrix of G. In this paper, we characterize the unique bipartite graph with maximum Estrada index among bipartite graphs with given matching number and given vertex-connectivity, edge-connectivity, respectively.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Fei Huang, Xueliang Li, Shujing Wang,