华东师范大学学报(自然科学版)
華東師範大學學報(自然科學版)
화동사범대학학보(자연과학판)
2003年
2期
16-21
,共6页
单圈图%Laplacian矩阵%代数连通度
單圈圖%Laplacian矩陣%代數連通度
단권도%Laplacian구진%대수련통도
unicyclic graph%Laplacian matrix%algebraic connectivity
G是一个图,A(G),D(G)分别是G的邻接矩阵和顶点度序列对角矩阵,则矩阵L(G)=D(G)-A(G)称为G的Laplacian矩阵.作者考察了单圈图的Laplacian矩阵的谱性质,并着重讨论了单圈图的代数连通度.
G是一箇圖,A(G),D(G)分彆是G的鄰接矩陣和頂點度序列對角矩陣,則矩陣L(G)=D(G)-A(G)稱為G的Laplacian矩陣.作者攷察瞭單圈圖的Laplacian矩陣的譜性質,併著重討論瞭單圈圖的代數連通度.
G시일개도,A(G),D(G)분별시G적린접구진화정점도서렬대각구진,칙구진L(G)=D(G)-A(G)칭위G적Laplacian구진.작자고찰료단권도적Laplacian구진적보성질,병착중토론료단권도적대수련통도.
Let G be a graph. The Laplacian matrix L ( G ) = D (G) - A ( G ) is the differenceof the diagonal matrix of vertex degrees and the 0- 1 adjacency matrix. Various aspects of thespectrum of this matrix of unicyclic graphs are investigated. Particular attention is given to thealgebraic connectivity, the second least eigenvalue of the Laplacian matrix.
