单圈图的Laplacian谱
The Laplacian Spectrum of Unicyclic Graphs
-
摘要: G 是一个图,A(G),D(G)分别是G 的邻接矩阵和顶点度序列对角矩阵,则矩阵L(G)=D(G)-A(G)称为G 的Laplacian 矩阵。作者考察了单圈图的Laplacian 矩阵的谱性质,并着重讨论了单圈图的代数连通度。
-
关键词:
- 单圈图 /
- Laplacian 矩阵 /
- 代数连通度
Abstract: Let G be a graph .The Laplacian matrix L(G)=D(G)-A(G)is the difference of the diagonal matrix of vertex degrees and the 0-1 adjacency matrix. Various aspects of the spectrum of this matrix of unicyclic graphs are investigated. Particular attention is given to the algebraic connecticity, the second least eigenvalue of the Laplacian matrix.
点击查看大图
计量
- 文章访问数: 2609
- HTML全文浏览量: 6
- PDF下载量: 393
- 被引次数: 0