| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4601145 | Linear Algebra and its Applications | 2012 | 6 Pages |
Abstract
For a graph G with eigenvalues λ1,λ2,…,λn, its Estrada index is defined as . We determine the unique graphs with maximum Estrada indices among graphs with given number of cut vertices, connectivity, and edge connectivity, respectively.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
