QQ客服 官方微博 反馈留言

	An improved upper bound for the Laplacian spectral radius of graphs
	Lu, Mei ; Liu, Huiqing ; Tian, Feng
	2010-10-12 ; 2010-10-12
关键词	Graph Laplacian spectral radius Maximum and minimum degree EIGENVALUES Mathematics
中文摘要	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.
语种	英语 ; 英语
出版者	ELSEVIER SCIENCE BV ; AMSTERDAM ; PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/81285]
专题	清华大学
推荐引用方式 GB/T 7714	Lu, Mei,Liu, Huiqing,Tian, Feng. An improved upper bound for the Laplacian spectral radius of graphs[J],2010, 2010.
APA	Lu, Mei,Liu, Huiqing,&Tian, Feng.(2010).An improved upper bound for the Laplacian spectral radius of graphs..
MLA	Lu, Mei,et al."An improved upper bound for the Laplacian spectral radius of graphs".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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