机构地区: 华南农业大学理学院应用数学系
出 处: 《高等学校计算数学学报》 2012年第3期260-266,共7页
摘 要: 1引言设G=(V,E)为n阶无向的简单连通图.记N(v)为v的所有相邻点的集合,则d(v)=|N(v)|称为顶点v的度.若d(v)=1,则称v为G的一个悬挂点.设D(G)=diag(d(v1),d(v2),…,d(vn))和A(G)分别表示图G的度对角矩阵和邻接矩阵,则L(G)=D(G)-A(G)称为图G的Laplace矩阵,而Q(G)=D(G)+A(G)称为图G的SignlessLaplace矩阵.用符号Nm×n表示一个m行n列的矩阵,Mn表示一个n阶的方阵. In the research of graph spectrum, it is always needed to calculate different characteristic polynomials of a graph on n vertices. Up to now, there does not exist any simple method for that. This paper presents a new method to calculate the characteristic polynomials of the adjacency, Laplacian and Signless Laplacian matrices pertaining to a graph G of order n, where G has a vertex v such that there are many pendant vertices being adjacent to v. The new method is based on the application of "matlab".