On the index of tricyclic graphs with perfect matchings

Let T(2k) be the set of all tricyclic 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 the largest index in T(2k).