On maximum Estrada indices of bipartite graphs with some given parameters

Abstract

The Estrada index of a graph $G$ is defined as $EE(G)={\sum }_{i=1}^n{e}^{{\lambda }_i}$, where ${\lambda }_1,$ ${\lambda }_2,\dots ,{\lambda }_n$ are the eigenvalues of the adjacency matrix of $G$. In this paper, we characterize the unique bipartite graph with maximum Estrada index among bipartite graphs with given matching number and given vertex-connectivity, edge-connectivity, respectively.

arXiv comment14 pages, 3 figures

References in corpus (3)

• Subgraph Centrality in Complex Networks
• Spectral Measures of Bipartivity in Complex Networks
• Maximum Estrada Index of Bicyclic Graphs