中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Lower bounds of the Laplacian spectrum of graphs based on diameter

文献类型:期刊论文

作者Lu, Mei; Zhang, Lian-zhu; Tian, Feng
刊名LINEAR ALGEBRA AND ITS APPLICATIONS
出版日期2007-01-15
卷号420期号:2-3页码:400-406
关键词algebraic connectivity Laplacian spectral radius diameter
ISSN号0024-3795
DOI10.1016/j.laa.2006.07.023
英文摘要Let G be a connected graph of order n. The diameter of G is the maximum distance between any two vertices of G. In the paper, we will give some lower bounds for the algebraic connectivity and the Laplacian spectral radius of G in terms of the diameter of G. (c) 2006 Elsevier Inc. All rights reserved.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000242908600010
出版者ELSEVIER SCIENCE INC
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/5143]  
专题中国科学院数学与系统科学研究院
通讯作者Lu, Mei
作者单位1.Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China
2.Xiamen Univ, Sch Math Sci, Xiamen 361005, Peoples R China
3.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Lu, Mei,Zhang, Lian-zhu,Tian, Feng. Lower bounds of the Laplacian spectrum of graphs based on diameter[J]. LINEAR ALGEBRA AND ITS APPLICATIONS,2007,420(2-3):400-406.
APA Lu, Mei,Zhang, Lian-zhu,&Tian, Feng.(2007).Lower bounds of the Laplacian spectrum of graphs based on diameter.LINEAR ALGEBRA AND ITS APPLICATIONS,420(2-3),400-406.
MLA Lu, Mei,et al."Lower bounds of the Laplacian spectrum of graphs based on diameter".LINEAR ALGEBRA AND ITS APPLICATIONS 420.2-3(2007):400-406.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。