Characterization on graphs which achieve a Das' upper bound for Laplacian spectral radius

doi:10.1016/j.laa.2004.11.019

CSpace

	Characterization on graphs which achieve a Das' upper bound for Laplacian spectral radius
	Yu, AM ; Lu, M ; Tian, F
	2005-05-01
发表期刊	LINEAR ALGEBRA AND ITS APPLICATIONS
ISSN	0024-3795
卷号	400 页码:271-277
摘要	Let G = (V, E) be a graph on vertex set V = {v(1), v(2),...,v(n)). For any vertex v(i), we denote by N(v(i)) the set of the vertices adjacent to v(i) in G. Das got the following upper bound for Laplacian spectral radius: l(1) (G) <= max {vertical bar N(v(i)) boolean OR N(v(j))vertical bar : 1 <= i < j <= n, v(i) v(j) is an element of E} In this paper, we characterize all the connected graphs which achieve the above upper bound. (c) 2004 Elsevier Inc. All rights reserved.
关键词	Laplacian matrix spectral radius degree
DOI	10.1016/j.laa.2004.11.019
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied
WOS记录号	WOS:000228674600017
出版者	ELSEVIER SCIENCE INC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/2277
专题	中国科学院数学与系统科学研究院
通讯作者	Lu, M
作者单位	1.Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China 2.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China 3.Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
推荐引用方式 GB/T 7714	Yu, AM,Lu, M,Tian, F. Characterization on graphs which achieve a Das' upper bound for Laplacian spectral radius[J]. LINEAR ALGEBRA AND ITS APPLICATIONS,2005,400:271-277.
APA	Yu, AM,Lu, M,&Tian, F.(2005).Characterization on graphs which achieve a Das' upper bound for Laplacian spectral radius.LINEAR ALGEBRA AND ITS APPLICATIONS,400,271-277.
MLA	Yu, AM,et al."Characterization on graphs which achieve a Das' upper bound for Laplacian spectral radius".LINEAR ALGEBRA AND ITS APPLICATIONS 400(2005):271-277.