On the index of bicyclic graphs with perfect matchings

CSpace

	On the index of bicyclic graphs with perfect matchings
	Chang, A ; Tian, F ; Yu, AM
	2004-06-06
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	283 期号:1-3 页码:51-59
摘要	Let R+ (2k) be the set of all bicyclic graphs on 2k(k greater than or equal to 2) vertices with perfect matchings. In this paper, we discuss some properties of the connected graphs with perfect matchings, and then determine graphs with maximal index in R+ (2k). (C) 2004 Elsevier B.V. All rights reserved.
关键词	bicyclic graphs index perfect matching upper bound
DOI	10.1016/j.disc.2004.02.005
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000221901100007
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/19658
专题	中国科学院数学与系统科学研究院
通讯作者	Chang, A
作者单位	1.Fuzhou Univ, Dept Math, Fuzhou 350002, Fujian, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Chang, A,Tian, F,Yu, AM. On the index of bicyclic graphs with perfect matchings[J]. DISCRETE MATHEMATICS,2004,283(1-3):51-59.
APA	Chang, A,Tian, F,&Yu, AM.(2004).On the index of bicyclic graphs with perfect matchings.DISCRETE MATHEMATICS,283(1-3),51-59.
MLA	Chang, A,et al."On the index of bicyclic graphs with perfect matchings".DISCRETE MATHEMATICS 283.1-3(2004):51-59.