Bounds of the extended Estrada index of graphs

Jing Li, Lu Qiao and Nan Gao

Applied Mathematics and Computation, 2018, vol. 317, issue C, 143-149

Abstract: Let G be a graph on n vertices and η1,η2,…,ηn the eigenvalues of its extended adjacency matrix. The extended Estrada index EEex is defined as the sum of the terms eηi,i=1,2,…,n. In this paper we establish lower and upper bounds for EEex in terms of the number of vertices and the number of edges and characterize the extremal graphs. Also the bounds for EEex of some special graphs are obtained.

Keywords: Extended adjacency matrix; Extended Estrada index; Bounds (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317306367
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:317:y:2018:i:c:p:143-149

DOI: 10.1016/j.amc.2017.09.015

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().