On the Estrada index conjecture

32Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Let G be a simple graph of order n with m edges. Let the adjacency spectrum be {λ1, λ2, ..., λn - 1, λn} of G, where λ1 ≥ λ2 ≥ ⋯ ≥ λn - 1 ≥ λn. The Estrada index of a graph G is EE (G) = ∑i = 1n eλi. In [J.A. Peña, I. Gutman, J. Rada, Estimating the Estrada index, Linear Algebra Appl. 427 (2007) 70-76], Peña et al. posed a conjecture that the star Sn has maximum Estrada index for any tree of order n and the path Pn has minimum Estrada index for any tree of order n or any connected graph of order n. In this paper, we have proved that the star has maximum Estrada index for any tree. Also, we obtain that the path has minimum Estrada index for any connected graph with m ≥ 1.8 n + 4 or m ≥ n2 / 6. Moreover, we give better lower bound on Estrada index for any connected graph. © 2009 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Das, K. C., & Lee, S. G. (2009). On the Estrada index conjecture. Linear Algebra and Its Applications, 431(8), 1351–1359. https://doi.org/10.1016/j.laa.2009.05.007

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free