A lower bound for the sum of the two largest signless Laplacian eigenvalues
Abstract
Let G be a graph of order n ≥ 3 with sequence degree given as d1(G) ≥ ... ≥ dn(G) and let μ1(G),..., μn(G) and q1(G), ..., qn(G) be the Laplacian and signless Laplacian eigenvalues of G arranged in non increasing order, respectively. Here, we consider the Grone's inequality [R. Grone, Eigenvalues and degree sequences of graphs, Lin. Multilin. Alg. 39 (1995) 133--136] Σi=1k μi(G) ≥ Σi=1k di(G)+1 and prove that for k=2, the equality holds if and only if G is the star graph Sn. The signless Laplacian version of Grone's inequality is known to be true when k=1. In this paper, we prove that it is also true for k=2, that is, q1(G)+q2(G) ≥ d1(G)+d2(G)+1 with equality if and only if G is the star Sn or the complete graph K3. When k ≥ 3, we show a counterexample.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.