Maximum Estrada Index of Bicyclic Graphs

Abstract

Let $G$ be a simple graph of order $n$, let ${\lambda }_1(G),{\lambda }_2(G),...,{\lambda }_n(G)$ be the eigenvalues of the adjacency matrix of $G$. The Esrada index of $G$ is defined as $EE(G)={\sum }_{i=1}^n{e}^{{\lambda }_i(G)}$. In this paper we determine the unique graph with maximum Estrada index among bicyclic graphs with fixed order.

Cited by in corpus (2)

• Resolvent Energy of Unicyclic, Bicyclic and Tricyclic Graphs
• On maximum Estrada indices of bipartite graphs with some given parameters