中文摘要：

研究了简单连通图的拟拉普拉斯矩阵前k个最大特征值的和，并利用图的度序列和阶数给出了该和的一个上界。

英文摘要：

The sum of the k largest eigenvalues of the signless Laplacian matrix of a simple connected graph is studied and an upper bound is obtained in terms of the degree sequence and the order of the graph.