A lower bound for the sum of the two largest signless Laplacian eigenvalues

preprint2014arXivOpen access

Abstract

Let GG be a graph of order n≥3n \geq 3 with sequence degree given as d1(G)≥...≥dn(G)d_{1}(G) \geq ... \geq d_{n}(G) and let μ1(G),...,μn(G)μ_1(G),..., μ_n(G) and q1(G),...,qn(G)q_1(G), ..., q_{n}(G) be the Laplacian and signless Laplacian eigenvalues of GG 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=1kdi(G)+1 \sum_{i=1}^{k} μ_{i}(G) \geq \sum_{i=1}^{k} d_{i}(G)+1 and prove that for k=2k=2, the equality holds if and only if GG is the star graph Sn.S_{n}. The signless Laplacian version of Grone's inequality is known to be true when k=1.k=1. In this paper, we prove that it is also true for k=2,k=2, that is, q1(G)+q2(G)≥d1(G)+d2(G)+1q_{1}(G)+q_{2}(G) \geq d_1(G)+d_2(G)+1 with equality if and only if GG is the star SnS_{n} or the complete graph K3.K_{3}. When k≥3k \geq 3, we show a counterexample.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.