Abstract
We prove that Brouwer’s conjecture holds for certain classes of graphs. We also give upper bounds for the sum of the largest Laplacian eigenvalues for graphs satisfying certain properties: those that contain a path or a cycle of a given size, graphs with a given matching number and graphs with a given maximum degree. Then we provide conditions for which these upper bounds are better than the previous known results.
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.
