CSpace
On the index of bicyclic graphs with perfect matchings
Chang, A; Tian, F; Yu, AM
2004-06-06
Source PublicationDISCRETE MATHEMATICS
ISSN0012-365X
Volume283Issue:1-3Pages:51-59
AbstractLet 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.
Keywordbicyclic graphs index perfect matching upper bound
DOI10.1016/j.disc.2004.02.005
Language英语
WOS Research AreaMathematics
WOS SubjectMathematics
WOS IDWOS:000221901100007
PublisherELSEVIER SCIENCE BV
Citation statistics
Cited Times:24[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/19658
Collection中国科学院数学与系统科学研究院
Affiliation1.Fuzhou Univ, Dept Math, Fuzhou 350002, Fujian, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Chang, A]'s Articles
[Tian, F]'s Articles
[Yu, AM]'s Articles
Baidu academic
Similar articles in Baidu academic
[Chang, A]'s Articles
[Tian, F]'s Articles
[Yu, AM]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Chang, A]'s Articles
[Tian, F]'s Articles
[Yu, AM]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.