Graphs characterized by Laplacian eigenvalue

被引：5
作者：
Zhang, XD [1 ]
机构：
[1] Shanghai Jiao Tong Univ, Dept Math, Shanghai 200030, Peoples R China
来源：
CHINESE ANNALS OF MATHEMATICS SERIES B | 2004年 / 25卷 / 01期
关键词：
graphs spectral theory; Laplacian eigenvalue; forbidden graph;
D O I：
10.1142/S025295990400010X
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
This paper characterizes all connected graphs with exactly two Laplacian eigenvalues greater than two and all connected graphs with exactly one Laplacian eigenvalue greater than three.
引用
收藏
页码：103 / 110
页数：8
相关论文
共 12 条
  • [1] Bermudez A. J., 1994, SAVMA Symposium 1994 Proceedings., P1
  • [2] Bondy J. A., 1976, Graph theory with applications
  • [3] Cvetkovic D., 1995, Spectra of Graphs-Theory and Application, V3rd ed.
  • [4] GRONE R, 2000, SIAM J MATRIX ANAL I, V11, P218
  • [5] GUO J, 2001, LINEAR ALGEBRA ITS A, V325, P71
  • [6] Gutman I, 1999, J SERB CHEM SOC, V64, P673
  • [7] Gutman I, 1998, ACH-MODELS CHEM, V135, P901
  • [8] A note on the second largest eigenvalue of the Laplacian matrix of a graph
    Li, JS
    Pan, YL
    [J]. LINEAR & MULTILINEAR ALGEBRA, 2000, 48 (02) : 117 - 121
  • [9] MERRIS R, 1994, LINEAR ALGEBRA APPL, V198, P143
  • [10] MERRIS R, 1991, MATH, V48, P345
12