On the spectral radius of bicyclic graphs

CSpace

	On the spectral radius of bicyclic graphs
	Yu, AM ; Tian, F
	2004-09-01
发表期刊	MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY
ISSN	0340-6253
期号	52 页码:91-101
摘要	Let B(n, m) be the set of all bicyclic graphs on n vertices with a maximum matching of cardinality m (m greater than or equal to 2). In this paper, we determine the graph with the largest spectral radius among the graphs in B(n, m), when m greater than or equal to 5.
语种	英语
WOS研究方向	Chemistry ; Computer Science ; Mathematics
WOS类目	Chemistry, Multidisciplinary ; Computer Science, Interdisciplinary Applications ; Mathematics, Interdisciplinary Applications
WOS记录号	WOS:000225479100007
出版者	UNIV KRAGUJEVAC, FACULTY SCIENCE
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/903
专题	中国科学院数学与系统科学研究院
通讯作者	Yu, AM
作者单位	1.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China 2.Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
推荐引用方式 GB/T 7714	Yu, AM,Tian, F. On the spectral radius of bicyclic graphs[J]. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY,2004(52):91-101.
APA	Yu, AM,&Tian, F.(2004).On the spectral radius of bicyclic graphs.MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY(52),91-101.
MLA	Yu, AM,et al."On the spectral radius of bicyclic graphs".MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY .52(2004):91-101.