Abstract
The molecular stability and related chemical properties are closely linked to the spectrum of the graph and corresponding eigenvalues. In quantum chemistry, spectral radius of graphs is the maximum energy level of molecules. Therefore, good upper bounds for the spectral radius is beneficial to estimate the energy of molecules. In this paper, we give two sharp upper bounds on the adjacency spectral radius of a graph in terms of degrees and the average 2-degrees of vertices. Moreover, we determine extremal graphs which achieve these upper bounds. Finally, some examples illustrate that the results are best in all known upper bounds in some sense.
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.
