For a graph G with eigenvalues λ1,λ 2, ⋯, λn, its Estrada index is defined as EE(G)=∑i=1ne λi. We determine the unique graphs with maximum Estrada indices among graphs with given number of cut vertices, connectivity, and edge connectivity, respectively. © 2011 Elsevier Inc. All rights reserved.
Du, Z., Zhou, B., & Xing, R. (2012). On maximum Estrada indices of graphs with given parameters. Linear Algebra and Its Applications, 436(9), 3767–3772. https://doi.org/10.1016/j.laa.2011.12.031