On the spectral radius of unicyclic graphs

CSpace

	On the spectral radius of unicyclic graphs
	Yu, AM; Tian, F
	2004-04-01
发表期刊	MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY
ISSN	0340-6253
期号	51 页码:97-109
摘要	Let U(n, m) be the set of all unicyclic graphs on n vertices with a maximum matching of cardinality m, (m greater than or equal to 2). Denote by U-1(n, m) the graph on n vertices obtained from C-3 by attaching n - 2m. + 1 pendant edges and m - 2 paths of length 2 together to one of three vertices of C-3. Denote by U-2 (n, m) the graph on n vertices obtained from C3 by attaching n - 2m. + 1 pendant edges and m, - 3 paths of length 2 together to one of three vertices, and two pendant edges to the other two vertices of C3, respectively. In this paper, we prove that U-1(n, m) arid U-2(n, m) have the largest and the second largest spectral radius among the graphs in U(n, m), respectively, when m greater than or equal to 4. We also discuss the corresponding results when m = 2, 3.
语种	英语
WOS研究方向	Chemistry ; Computer Science ; Mathematics
WOS类目	Chemistry, Multidisciplinary ; Computer Science, Interdisciplinary Applications ; Mathematics, Interdisciplinary Applications
WOS记录号	WOS:000222332700005
出版者	UNIV BAYREUTH, DEPT MATHEMATICS
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/19595
专题	中国科学院数学与系统科学研究院
通讯作者	Yu, AM
作者单位	Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Yu, AM,Tian, F. On the spectral radius of unicyclic graphs[J]. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY,2004(51):97-109.
APA	Yu, AM,&Tian, F.(2004).On the spectral radius of unicyclic graphs.MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY(51),97-109.
MLA	Yu, AM,et al."On the spectral radius of unicyclic graphs".MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY .51(2004):97-109.