Abstract
The Estrada index of a graph G is defined as EE(G)=∑i=1neλi, where λ1, λ2,…,λ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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
