| GRAPHS CHARACTERIZED BY LAPLACIAN EIGENVALUES |
| |
| 作者姓名： | ZHANG Xiaodong |
| |
| 作者单位： | ZHANG Xiaodong Department of Mathematics，Shanghai Jiaotong University，Shanghai 200030，China. |
| |
| 基金项目： | the National Natural Science Foundation of China，the Scientific Research
Foundation for the Returned Overseas Chinese Scholars，the Ministry of Education of China. |
| |
| 摘 要： | §1. Introduction Let G = (V,E) be a simple graph. The Laplacian matrix of G is L(G) = D(G)?A(G),where D(G) = diag (du,u ∈V (G)) (du is the degree of a vertex u) and A(G) are the degreediagonal and the adjacency matrices of G. The eigenvalues of L(G) are called the Laplacianeigenvalues and denoted by λ1(G) ≥λ2(G) ≥···≥λn(G) = 0or for short λ1 ≥λ2 ≥···≥λn = 0.The Laplacian matrix of a simple gra…
|
| 关 键 词： | LAPLACIAN特征值 禁用图 简单图 LAPLACIAN矩阵 |
| 收稿时间： | 6/2/2025 12:00:00 AM |
GRAPHS CHARACTERIZED BY LAPLACIAN EIGENVALUES |
| |
| ZHANG Xiaodong.GRAPHS CHARACTERIZED BY LAPLACIAN EIGENVALUES[J].Chinese Annals of Mathematics,Series B,2004,25(1):103-110. |
| |
| Authors: | ZHANG Xiaodong |
| |
| Institution: | Department of Mathematics, Shanghai Jiaotong University, Shanghai 200030, China |
| |
| Abstract: | This paper characterizes all connected graphs with exactly two Laplacian eigenval-ues greater than two and all connected graphs with exactly one Laplacian eigenvalue greater than three. |
| |
| Keywords: | Graphs spectral theory Laplacian eigenvalue Forbidden graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《数学年刊B辑(英文版)》浏览原始摘要信息 |
| 点击此处可从《数学年刊B辑(英文版)》下载免费的PDF全文 |
