English

Nordhaus--Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues

Combinatorics 2014-02-14 v1

Abstract

Let GG be a graph with nn vertices. We denote the largest signless Laplacian eigenvalue of GG by q1(G)q_1(G) and Laplacian eigenvalues of GG by μ1(G)μn1(G)μn(G)=0\mu_1(G)\ge\cdots\ge\mu_{n-1}(G)\ge\mu_n(G)=0. It is a conjecture on Laplacian spread of graphs that μ1(G)μn1(G)n1\mu_1(G)-\mu_{n-1}(G)\le n-1 or equivalently μ1(G)+μ1(\Gb)2n1\mu_1(G)+\mu_1(\Gb)\le2n-1. We prove the conjecture for bipartite graphs. Also we show that for any bipartite graph GG, μ1(G)μ1(\Gb)n(n1)\mu_1(G)\mu_1(\Gb)\le n(n-1). Aouchiche and Hansen [A survey of Nordhaus--Gaddum type relations, Discrete Appl. Math. 161 (2013), 466--546] conjectured that %for any graph GG with nn vertices, q1(G)+q1(\Gb)3n4q_1(G)+q_1(\Gb)\le3n-4 and q1(G)q1(\Gb)2n(n2)q_1(G)q_1(\Gb)\le2n(n-2). We prove the former and disprove the latter by constructing a family of graphs HnH_n where q1(Hn)q1(\ovHn)q_1(H_n)q_1(\ov{H_n}) is about 2.15n2+O(n)2.15n^2+O(n).

Keywords

Cite

@article{arxiv.1402.2995,
  title  = {Nordhaus--Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues},
  author = {F. Ashraf and B. Tayfeh-Rezaie},
  journal= {arXiv preprint arXiv:1402.2995},
  year   = {2014}
}