Upper bounds for the sum of Laplacian eigenvalues of graphs

Let G be a graph with n vertices and $e(G)$ edges, and let ${\mu }_1(G)?{\mu }_2(G)???{\mu }_n(G)=0$ be the Laplacian eigenvalues of G. Let $S_k(G)={\sum }_{i=1}^k{\mu }_i(G)$, where $1?k?n$. Brouwer conjectured that $S_k(G)?e(G)+\left(\genfrac{}{}{0ex}{}{k+1}{2}\right)$ for $1?k?n$. It has been shown in Haemers et al. 7] that the conjecture is true for trees. We give upper bounds for $S_k(G)$, and in particular, we show that the conjecture is true for unicyclic and bicyclic graphs.