Tetracyclic graphs with maximal Estrada index, By Doost Ali Mojdeh

Research

Title	Tetracyclic graphs with maximal Estrada index
Type	Article
Keywords	Eigenvalue, Estrada index, Four-cyclic graph, Walk.
Journal	Discrete Mathematics, Algorithms and Applications
DOI	DOI:10.1142/S1793830917500410
Researchers	Nader Jafari Rad (First researcher) , Akbar Jahanbani (Second researcher) , Doost Ali Mojdeh (Third researcher)

Abstract

The Estrada index of a simple connected graph GG of order nn is defined as EE(G)=∑ni=1eλiEE(G)=∑i=1neλi, where λ1,λ2,…,λnλ1,λ2,…,λn are the eigenvalues of the adjacency matrix of GG. In this paper, we characterize all tetracyclic graphs of order nn with maximal Estrada index.