Abstract
Let G be a regular graph with m edges, and let μ1,μ2 denote the two largest eigenvalues of AG, the adjacency matrix of G. We show that, if G is not complete, thenμ12+μ22≤2(ω−1)ωm where ω is the clique number of G. This confirms a conjecture of Bollobás and Nikiforov for regular graphs. We also show that equality holds if and only if G is either a balanced Turán graph or the disjoint union of two balanced Turán graphs of the same size.
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.
