The Eigenvalues and Laplacian Eigenvalues of A Graph

摘要：

Let G be a simple undirected graph, its Laplacian matrix is L(G) = D(G) - A(G), where D(G) is the diagonal matrix of its vertex degrees and A(G) is its adjacency matrix. In the paper, using some properties of matrix, the eigenvalues and Laplacian eigenvalues of KsSn-s are studied.

关键词： Graph Adjacency matriz Laplacian matriz Eigenvalue Spectrum

作者: Haitang Wang

作者单位: Department of Mathematics, Shandong Jiaotong University, Jinan, 250023, PR China

会议类型: 国际会议

会议名称: The Third International Workshop on Applied Matriz Theory(第三届国际矩阵分析与应用会议)

会议地点: 杭州

会议语种:英文

页码: 1038-1042

在线出版日期: 2009-07-09（万方平台首次上网日期，不代表论文的发表时间）