Abstract
The Estrada index of a graph G is defined as EE(G)=∑i=1neλi, where λ1,λ2,…,λn are the eigenvalues of G. We determine the unique unicyclic graph with maximum Estrada index, the unique bipartite unicyclic graph with maximum Estrada index, and the unique bipartite unicyclic graph of a given bipartition with maximum Estrada index. We also show that only two graphs are possible to be the unicyclic graph(s) with minimum Estrada index.
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.
