中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
On the spectral radius of graphs with cut edges

文献类型:期刊论文

作者Liu, HQ; Lu, M; Tian, F
刊名LINEAR ALGEBRA AND ITS APPLICATIONS
出版日期2004-09-15
卷号389页码:139-145
关键词spectral radius cut edge limit point
ISSN号0024-3795
DOI10.1016/j.laa.2004.03.026
英文摘要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.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000223567400010
出版者ELSEVIER SCIENCE INC
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/19672]  
专题中国科学院数学与系统科学研究院
通讯作者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.

入库方式: OAI收割

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

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

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