{"paper":{"title":"An increasing sequence of lower bounds for the Estrada index of graphs and matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.CO","authors_text":"Jonnathan Rodr\\'iguez, Juan R. Carmona","submitted_at":"2018-11-29T13:41:29Z","abstract_excerpt":"Let $G$ be a graph on $n$ vertices and $\\lambda_1\\geq \\lambda_2\\geq \\ldots \\geq \\lambda_n$ its eigenvalues. The Estrada index of $G$ is defined as $EE(G)=\\sum_{i=1}^n e^{\\lambda_i}.$ In this work, we using an increasing sequence converging to the $\\lambda_1$ to obtain an increasing sequence of lower bounds for $EE(G)$. In addition, we generalize this succession for the Estrada index of an arbitrary nonnegative Hermitian matrix."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12138","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}