用代数方法给出了一个关于连通图顶点度数的不等式,并给出了连通图拟拉普拉斯矩阵的最大特征值的几个上界.
An inequality about degree of vertex of a connected graph can be given, and the upper bounds of the largest eigenvalue of the quasi-Laplacian matrix of a connected graph can be obtained.