The Laplacian spectrum of a graph

被引：100
作者：
Das, KC [1 ]
机构：
[1] Indian Inst Technol, Dept Math, Kharagpur 721302, W Bengal, India
来源：
COMPUTERS & MATHEMATICS WITH APPLICATIONS | 2004年 / 48卷 / 5-6期
关键词：
graph; Laplacian matrix; largest eigenvalue; upper bound;
D O I：
10.1016/j.camwa.2004.05.005
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let G = (V, E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then, the Laplacian matrix of G is L(G) = D(G) A(G). The first and second section of this paper contains introduction and some known results, respectively. The third section is devoted to properties of Laplacian spectrum. The fourth section contains characterization of graphs. The fifth section relates the Laplacian eigenvalues with the graph structure. (C) 2004 Elsevier Ltd. All rights reserved.
引用
收藏
页码：715 / 724
页数：10
相关论文
共 11 条
[1]  
[Anonymous], 1980, SPECTRA GRAPHS THEOR
[2]  
[Anonymous], LINEAR ALGEBRA APPL
[3]   Sharp lower bounds on the Laplacian eigenvalues of trees [J].
Das, KC .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2004, 384 :155-169
[4]   A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs [J].
Das, KC .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2004, 376 :173-186
[5]  
DAS KC, IN PRESS DISCRETE MA
[6]   THE LAPLACIAN SPECTRUM OF A GRAPH .2. [J].
GRONE, R ;
MERRIS, R .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1994, 7 (02) :221-229
[7]  
GRONE R, 1990, LINEAR MULTILINEAR A, V28, P45
[8]   On the Laplacian spectral radius of a tree [J].
Guo, JM .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2003, 368 :379-385
[9]  
Heuvel JV, 1995, LINEAR ALGEBRA APPL, V226-228, P723
[10]  
MOHAR B, 1991, P GRAPH THEOR COMB A, P871
12