On the index of bicyclic graphs with perfect matchings - Details

author：

Chang, A. (Chang, A..) ^[1] | Tian, F. (Tian, F..) ^[2] | Yu, A. (Yu, A..) ^[3]

Indexed by：

Scopus

Abstract：

Let　script　B　sign　+(2k)　be　the　set　of　all　bicyclic　graphs　on　2k(k≥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　script　B　sign　+(2k).　©　2004　Elsevier　B.V.　All　rights　reserved.

Keyword：

Bicyclic graphs; Index; Perfect matching; Upper bound

Community：

[ 1 ] [Chang, A.]Department of Mathematics, Fuzhou University, Fuzhou, Fujian 350002, China
[ 2 ] [Tian, F.]Acad. of Math. and System Science, Chinese Academy of Science, Beijing 100080, China
[ 3 ] [Yu, A.]Acad. of Math. and System Science, Chinese Academy of Science, Beijing 100080, China

Reprint 's Address：

[Chang, A.]Department of Mathematics, Fuzhou University, Fuzhou, Fujian 350002, China

Email：

anchang@pub6.fz.fj.cn

Show more details

Related Keywords：

Source ：

Discrete Mathematics

ISSN： 0012-365X

Year： 2004

Issue： 1-3

Volume： 283

Page： 51-59

0 . 3 7 4

JCR@2004

0 . 7 0 0

JCR@2023

JCR Journal Grade：3

Cited Count：

WoS CC Cited Count：

SCOPUS Cited Count：

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 1

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to