CSpace
On the spectral radius of unicyclic graphs with perfect matchings
Chang, A; Tian, F
2003-09-01
发表期刊LINEAR ALGEBRA AND ITS APPLICATIONS
ISSN0024-3795
卷号370页码:237-250
摘要Let U+(2k) be the set of all unicyclic graphs on 2k (k greater than or equal to 2) vertices with perfect matchings. Let U-2k(1) be the graph on 2k vertices obtained from C-3 by attaching a pendant edge and k - 2 paths of length 2 at one vertex of C-3; Let U-2k(2) be the graph on 2k vertices obtained from 2k C-3 by adding a pendant edge at each vertex together with k - 3 paths of length 2 at one of three vertices. In this paper, we prove that U-2k(1) and U-2k(2) have the largest and the second largest spectral radius among the graphs in U+ (2k) when k not equal 3. (C) 2003 Elsevier Inc. All rights reserved.
关键词unicyclic graphs spectral radius perfect matching
DOI10.1016/S0024-3795(03)00394-X
语种英语
WOS研究方向Mathematics
WOS类目Mathematics, Applied
WOS记录号WOS:000184555200015
出版者ELSEVIER SCIENCE INC
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/18041
专题中国科学院数学与系统科学研究院
通讯作者Chang, A
作者单位1.Fuzhou Univ, Dept Math, Fujian 350002, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Chang, A,Tian, F. On the spectral radius of unicyclic graphs with perfect matchings[J]. LINEAR ALGEBRA AND ITS APPLICATIONS,2003,370:237-250.
APA Chang, A,&Tian, F.(2003).On the spectral radius of unicyclic graphs with perfect matchings.LINEAR ALGEBRA AND ITS APPLICATIONS,370,237-250.
MLA Chang, A,et al."On the spectral radius of unicyclic graphs with perfect matchings".LINEAR ALGEBRA AND ITS APPLICATIONS 370(2003):237-250.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Chang, A]的文章
[Tian, F]的文章
百度学术
百度学术中相似的文章
[Chang, A]的文章
[Tian, F]的文章
必应学术
必应学术中相似的文章
[Chang, A]的文章
[Tian, F]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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