中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
On the index of bicyclic graphs with perfect matchings

文献类型:期刊论文

作者Chang, A; Tian, F; Yu, AM
刊名DISCRETE MATHEMATICS
出版日期2004-06-06
卷号283期号:1-3页码:51-59
关键词bicyclic graphs index perfect matching upper bound
ISSN号0012-365X
DOI10.1016/j.disc.2004.02.005
英文摘要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.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000221901100007
出版者ELSEVIER SCIENCE BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/19657]  
专题中国科学院数学与系统科学研究院
通讯作者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.

入库方式: OAI收割

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

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

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