On the sum of the first two largest signless Laplacian eigenvalues of a graph
Abstract
For a graph G, let S2(G) be the sum of the first two largest signless Laplacian eigenvalues of G, and f(G)=e(G)+3-S2(G). Oliveira, Lima, Rama and Carvalho conjectured that K+1,n-1 (the star graph with an additional edge) is the unique graph with minimum value of f(G) on n vertices. In this paper, we prove this conjecture, which also confirm a conjecture for the upper bound of S2(G) proposed by Ashraf et al.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.