Abstract
Let G be a graph on n vertices and let λ 1,λ 2,…,λ n be its eigenvalues. The energy of G is defined as E(G)=|λ 1|+|λ 2|+⋯+|λ n| . For various classes of unicyclic graphs, the graphs with maximal energy are determined. Let P n 6 be obtained by connecting a vertex of the circuit C 6 with a terminal vertex of the path P n−6 . For n⩾7, P n 6 has the maximal energy among all connected unicyclic bipartite n-vertex graphs, except the circuit C n .
Sign-in/Register to access full text options 
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.
