图拟拉普拉斯矩阵的特征值  

On the Eigenvalue of the Quasi-Laplacian Matrix of a Graph

作　　者：郭曙光[1] 

机构地区：[1]盐城师范学院数学系,江苏盐城224002

出　　处：《淮阴师范学院学报（自然科学版）》2003年第1期10-12,共3页Journal of Huaiyin Teachers College;Natural Science Edition

摘　　要：G为有限无向简单图.A(G),D(G)分别表示G的邻接矩阵和度对角矩阵.Q(G) =D(G) +A(G)称为图G的拟拉普拉斯矩阵,它是谱图论的研究对象.本文利用G的顶点数,边数,最大度和最小度给出Q(G)的最大特征值和最小特征值的界的估计.Let G be a finite undirected graph without loops and multiple edges. A(G), D(G) denotes the adjacency matrix and the diagonal matrix of vertex degrees of G, respectively. Q(G)=D(G)+A(G) is the quasi-Laplacian matrix of G. In this paper, we give the estimation of the largest and the smallest eigenvalues of Q(G) in terms of the vertex number, the edge number, the largest degree, and the smallest degree of G.

关 键 词：简单图 拟拉普拉斯矩阵 特征值 

分 类 号：O157.5[理学—数学]