The Estrada index of evolving graphs

Yilun Shang

Applied Mathematics and Computation, 2015, vol. 250, issue C, 415-423

Abstract: The Estrada index of a simple graph G with adjacency matrix A is defined as EE(G)=trace(eA). It can be used in a range of fields as an efficient measuring tool. An evolving graph G1,G2,…,GN is a time-ordered sequence of graphs over a fixed set of vertices. By using the natural definition of a walk on the evolving graph that respects the arrow of time, we extend the (static) Estrada index to accommodate this promising dynamic setting. We find that although asymmetry is raised intrinsically by time’s arrow, the dynamic Estrada index is order invariant. We establish some lower and upper bounds for the dynamic Estrada index in terms of the numbers of vertices and edges. Illustrative examples are worked out to demonstrate the computations involved.

Keywords: Estrada index; Evolving graph; Closed walks; Eigenvalue (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314015045
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:250:y:2015:i:c:p:415-423

DOI: 10.1016/j.amc.2014.10.129

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