中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 数学与系统科学研究院
  3. 中国科学院数学与系统科学研究院
An improved upper bound for the Laplacian spectral radius of graphs

文献类型：期刊论文

作者Lu, Mei1; Liu, Huiqing2; Tian, Feng3
刊名DISCRETE MATHEMATICS
出版日期2009-11-06
卷号309期号:21页码:6318-6321
关键词Graph Laplacian spectral radius Maximum and minimum degree
ISSN号0012-365X
DOI10.1016/j.disc.2009.06.012
英文摘要Let G be a simple graph with n vertices, m edges. Let Delta and delta be the maximum and minimum degree of G, respectively. If each edge of G belongs to t triangles (t >= 1), then we present a new upper bound for the Laplacian spectral radius of G as follows: lambda(1)(G) <= 2 Delta - t root(2 Delta - t)(2) + 8m -4 delta(n - 1) - 4 delta(2) + 4(delta - 1)Delta/2 Moreover, we give an example to illustrate that our result is, in some cases, the best. (C) 2009 Elsevier B.V. All rights reserved.
资助项目NNSFC[10571105] ; NNSFC[10671081] ; NNSFC[10431020] ; NSF of Hubei Provincial Department of Education[D20081005] ; NSF of Hubei Provincial Department of Education[T200901] ; Open Research Fund of Hubei Key Laboratory of Applied Mathematics
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000272099900018
出版者ELSEVIER SCIENCE BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/9023]  
专题中国科学院数学与系统科学研究院
通讯作者Lu, Mei
作者单位1.Tsinghua Univ, Dept Math Sci, Beijing 100084, Peoples R China
2.Hubei Univ, Sch Math & Comp Sci, Wuhan 430062, Peoples R China
3.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714		 Lu, Mei,Liu, Huiqing,Tian, Feng. An improved upper bound for the Laplacian spectral radius of graphs[J]. DISCRETE MATHEMATICS,2009,309(21):6318-6321.
APA Lu, Mei,Liu, Huiqing,&Tian, Feng.(2009).An improved upper bound for the Laplacian spectral radius of graphs.DISCRETE MATHEMATICS,309(21),6318-6321.
MLA Lu, Mei,et al."An improved upper bound for the Laplacian spectral radius of graphs".DISCRETE MATHEMATICS 309.21(2009):6318-6321.

入库方式： OAI收割

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

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

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