An increasing sequence of lower bounds for the Estrada index of graphs\n and matrices

2018/11/29 by Juan R. Carmona, Jonnathan Rodríguez, Carmona, Juan R. +1
Computer Science · Mathematics · #05C50 #15A18 #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Matrix Theory and Algorithms #Spectral Theory (math.SP)

paper · pdf · doi:10.48550/arxiv.1811.12138

openalex publication_date 2018/11/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let G be a graph on n vertices and \λ₁\≥ \λ₂\≥ \…\n\≥ \λ_n its eigenvalues. The Estrada index of G is defined as\nEE(G)=\∑_i=1ⁿ e^\λ_i. In this work, we using an increasing\nsequence converging to the \λ₁ to obtain an increasing sequence of\nlower bounds for EE(G). In addition, we generalize this succession for the\nEstrada index of an arbitrary nonnegative Hermitian matrix.\n

Citations

• Characterization of 3D molecular structure

Related

• New lower bounds for the Estrada and Signless Laplacian Estrada Index of\n a Graph
• Some New Lower Bounds for the Estrada Index
• On maximum Estrada indices of bipartite graphs with some given parameters
• Bounds For The Distance Estrada Index Of Graphs
• Estimating the distance Estrada index