Indexed by：
Abstract：
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.
Keyword：
Reprint 's Address：
Email：
Version：
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
ESI Discipline： MATHEMATICS;
JCR Journal Grade：3
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：
