QQ客服 官方微博 反馈留言

	Lower bounds of the Laplacian spectrum of graphs based on diameter
	Lu, Mei ; Zhang, Lian-zhu ; Tian, Feng
	2010-05-06 ; 2010-05-06
关键词	algebraic connectivity Laplacian spectral radius diameter ALGEBRAIC CONNECTIVITY EIGENVALUES Mathematics, Applied
中文摘要	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.
语种	英语 ; 英语
出版者	ELSEVIER SCIENCE INC ; NEW YORK ; 360 PARK AVE SOUTH, NEW YORK, NY 10010-1710 USA
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/13880]
专题	清华大学
推荐引用方式 GB/T 7714	Lu, Mei,Zhang, Lian-zhu,Tian, Feng. Lower bounds of the Laplacian spectrum of graphs based on diameter[J],2010, 2010.
APA	Lu, Mei,Zhang, Lian-zhu,&Tian, Feng.(2010).Lower bounds of the Laplacian spectrum of graphs based on diameter..
MLA	Lu, Mei,et al."Lower bounds of the Laplacian spectrum of graphs based on diameter".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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