On the extended Estrada index of some graphs

Jing Li, Nan Gao, Lu Qiao and Sujuan Liu

Applied Mathematics and Computation, 2019, vol. 355, issue C, 311-318

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 show the extended Estrada index of the complete bipartite graphs and the friendship graphs. Also the relationship of the extended Estrada index between the m-splitting, m-shadow graphs and the original graphs are obtained.

Keywords: Extended adjacency matrix; Extended Estrada index; Bound (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319301791
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:355:y:2019:i:c:p:311-318

DOI: 10.1016/j.amc.2019.02.069

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 ().