摘要
设G为具有n个顶点的简单连通图,矩阵Q(G)=D(G)+A(G)称为图G的无符号Laplacian矩阵,研究了图的无符号Laplacian矩阵,利用特殊的不等式给出了无符号Laplacian矩阵的最大和最小特征值的几个界.
Let G be a simple connected graph with n vertices. The matrix Q（G）= D（G）＋ A（G） is called signless Laplacian matrix of G. Studied the signless Laplacian of graphs, and given some bounds of eigenvalues of signless Laplacian by means of special inequalities.
出处
《高师理科学刊》
2008年第2期7-9,共3页
Journal of Science of Teachers＇College and University
基金
山东省自然科学基金项目(Y2006A17)
山东省教育厅项目(J07YH03)
