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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
