CSpace
On the spectral radius of graphs with cut edges
Liu, HQ; Lu, M; Tian, F
2004-09-15
发表期刊LINEAR ALGEBRA AND ITS APPLICATIONS
ISSN0024-3795
卷号389页码:139-145
摘要We study the spectral radius of graphs with n vertices and k cut edges. In this paper, we show that of all the connected graphs with n vertices and k cut edges, the maximal spectral radius is obtained uniquely at K-n(k), where K-n(k) is a graph obtained by joining k independent vertices to one vertex of Kn-k. We also discuss the limit point of the maximal spectral radius. (C) 2004 Elsevier Inc. All rights reserved.
关键词spectral radius cut edge limit point
DOI10.1016/j.laa.2004.03.026
语种英语
WOS研究方向Mathematics
WOS类目Mathematics, Applied
WOS记录号WOS:000223567400010
出版者ELSEVIER SCIENCE INC
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/19673
专题中国科学院数学与系统科学研究院
通讯作者Lu, M
作者单位1.Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Liu, HQ,Lu, M,Tian, F. On the spectral radius of graphs with cut edges[J]. LINEAR ALGEBRA AND ITS APPLICATIONS,2004,389:139-145.
APA Liu, HQ,Lu, M,&Tian, F.(2004).On the spectral radius of graphs with cut edges.LINEAR ALGEBRA AND ITS APPLICATIONS,389,139-145.
MLA Liu, HQ,et al."On the spectral radius of graphs with cut edges".LINEAR ALGEBRA AND ITS APPLICATIONS 389(2004):139-145.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Liu, HQ]的文章
[Lu, M]的文章
[Tian, F]的文章
百度学术
百度学术中相似的文章
[Liu, HQ]的文章
[Lu, M]的文章
[Tian, F]的文章
必应学术
必应学术中相似的文章
[Liu, HQ]的文章
[Lu, M]的文章
[Tian, F]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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