On a Lower Bound for the Laplacian Eigenvalues of a Graph
暂无分享,去创建一个
If $$\mu _m$$μm and $$d_m$$dm denote, respectively, the m-th largest Laplacian eigenvalue and the m-th largest vertex degree of a graph, then $$\mu _m \geqslant d_m-m+2$$μm⩾dm-m+2. This inequality was conjectured by Guo (Linear Multilinear Algebra 55:93–102, 2007) and proved by Brouwer and Haemers (Linear Algebra Appl 429:2131–2135, 2008). Brouwer and Haemers gave several examples of graphs achieving equality, but a complete characterisation was not given. In this paper we consider the problem of characterising graphs satisfying $$\mu _m = d_m-m+2$$μm=dm-m+2. In particular we give a full classification of graphs with $$\mu _m = d_m-m+2 \leqslant 1$$μm=dm-m+2⩽1.
[1] Russell Merris,et al. The Laplacian Spectrum of a Graph II , 1994, SIAM J. Discret. Math..
[2] Ji-Ming Guo. On the third largest Laplacian eigenvalue of a graph , 2007 .
[3] Yong-Liang Pan,et al. A note on the second largest eigenvalue of the laplacian matrix of a graph , 2000 .
[4] W. Haemers,et al. A lower bound for the Laplacian eigenvalues of a graph—Proof of a conjecture by Guo , 2008 .
[5] Willem H. Haemers,et al. Spectra of Graphs , 2011 .